title: Partition algorithm to split set of objects
body: <p>Can somebody confirm if an algorithm exist to solve this? I assume even if something exist, it will be NP complete.</p>
  
  <p>Lets say there is a <code>Set&lt;Set&lt;Object&gt;&gt;</code> where the total number of elements is 165. This has to be partitioned into three sets of each 55 elements(or lesser), such that elements in the inner set is not distributed among multiple sets after partition.</p>
  
  <p>Please don't ditch this question as homework types. I have searched enough and I couldn't classify this algorithm properly for me to research efficiently.</p>