list of unique non-subset sets

les_ander at yahoo.com les_ander at yahoo.com
Sat Mar 19 00:46:44 CET 2005


OK, so I need to be more precise.
Given a list of sets, output the largest list of sets (from this list,
order does not matter) such that:
1) there is no set that is a PROPER subset of another set in this list
2) no two sets have exactly the same members (100% overlap)

Seems like this problem is much harder than I thought...




More information about the Python-list mailing list