This week's book giveaway is in the OCPJP forum. We're giving away four copies of OCA/OCP Java SE 7 Programmer I & II Study Guide and have Kathy Sierra & Bert Bates 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?