We are given an array of integers such that the number of integers in the array is a multiple of 3, i.e., the number of elements in the array is 3m for some natural number m
- We have to divide the array into m triplets (group of 3), such that all these triplets have the same sum
- The triplets must be disjoint, i.e. no element from the array can occur in more than a single triplet, and they must cover the array, i.e. each element of the array must belong to some triplet