I am trying to find an efficient solution to subsequent problem:
I have a number of x lists (number unknown) with each having different but also overlapping elements. I would like to find the elements unique to each list and output them separately.
For example if I have 3 lists:
a = [1,2,3,4]
b = [2,5,6,7]
c = [3,6,8,9]
This would result in an output of (I am not trying to find the unique elements only):
a --> [1,4]
b --> [5,7]
c --> [8,9]
Assuming that one list gets generated sequentially. I was thinking of using sets but believe that this can be solved when each list gets generated.