We are given a multiset of integers such that the number of integers in the multiset is a multiple of 3, i.e., the number of elements in the multiset is 3m for some natural number m
- We have to partition the multiset into triplets such that all of them have the same sum
- The triplets must partition the multiset, that is they are disjoint and cover the input multiset
