Question

I have to create unique, unordered sets of 2 elements each from a list of numbers. Then insert each set into a list.

Eg:

1. setslist = [(2,1)]
2. uniquenumbers = [1,2,3]
3. unique sets- (1,2),(2,3),(1,3)
4. insert each set in setslist if it doesnt already exists. (Sets are unordered. So (1,2) is same as (2,1))
5. Final setslist = [(2,1),(2,3),(1,3)]

What is the most optimized solution in python?

Answer 1

import itertools
existing_sets = set(frozenset(x) for x in setslist)
new_sets = set(frozenset(x) for x in itertools.combinations(uniquenumbers, 2))
setslist = list(existing_sets | new_sets)