There are several problems related to the partitioning of array into k subsets .

Like :-partition the array into k parts such that :

- sum of average of each partition is maximum.
- sum of their maximum element is minimum

3.sum of their minimum element is maximum

4.sum in each partition is equal

… there are many such questions .

how can we solve the question related to the partitioning ?

I am not able to get how shall i start and how should I proceed in these questions , help me please .