title: Collection of maximum disjoint sets
body: <p>Given a collection of a set of 3 numbers, find the maximum disjoint sets. For example, let C = {(3,4,5), (4,5,6), (1,2,3), (6,9,10), (7,8,9)}. This input should return 3, since the maximum disjoint sets are {(1,2,3), (4,5,6), (7,8,9)}. How can I write a program that will output the collection of maximum disjoint sets?</p>
  
  <p>I've thought about starting off by selecting all 5 sets. Then, look at each set and see if removing that element will affect the rest of the sets. If we take away (3,4,5), it will allow us to keep (4,5,6) and (1,2,3). Thus, its net benefit is +1. We should remove it from our final list. Then, if we take away (4,5,6), it will allow us to keep (6,9,10). The net benefit is 0, so don't remove it. Removing (1,2,3) will affect nothing. Don't remove it. Removing (6,9,10) will allow us to keep (7,8,9). Not sure if that makes any sense but let me know what you think!</p>