Problem in Question on GFG

#1

sir I am trying to solve this question of DP but not getting it can you please help me.

https://practice.geeksforgeeks.org/problems/partition-array-to-k-subsets/1

#2

I don’t think DP can be used, try backtracking with optimization.
Make a subset[k] array representing sum of k partitions, now try to achieve subset[i] = totalsum/k.
For more hint unlock editorial.