This week's book giveaway is in the OCAJP 8 forum. We're giving away four copies of OCA Java SE 8 Programmer I Study Guide and have Edward Finegan & Robert Liguori 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?