In union of two linked list we need to make sure there are no duplicates after the union of two linked lists because sets doesn't have duplicate elements. If one list is of size $n$ and other of size $m$ then time complexity of union of these two list is $O(mn)$
In concat duplicates doesn't matter so we just need to join the 2 list which takes $O min(m,n)$ time
