This week's book giveaway is in the OO, Patterns, UML and Refactoring forum. We're giving away four copies of Refactoring for Software Design Smells: Managing Technical Debt and have Girish Suryanarayana, Ganesh Samarthyam & Tushar Sharma on-line! See this thread for details.
I want to ensure that a List of Lists contains no element which is subsumed by another. Each nested List should contain at least one unique element compared to any other nested List.
This code works, but seems horribly inefficient. Is there a better way?