LeetCode 698. Partition to K Equal Sum Subsets

[@SHASHANKRUSTAGII]

This is one of the most toughest problem

[@wendyhu6988]

Really impressive explanation!!

[@john_rambo_27098]

Excellent work!!!! Really liked the breakdown.

[@happycoding1093]

You are welcome!

[@bhumikaumar5303]

Is there any explaination for DP solution for this problem

[@janmejaysingh7402]

Nice explanation. Watched it again after one month and it is even more clear, I have only one question. Why this problem is classified in DP in leetcode?

[@happycoding1093]

because this problem can also be solved by using DP + bit mask. I just wrote the solution here: @lru_cache(None) def dp(k, mask, remain): if k == 0: return True ans = False for i in range(n): if mask & (1

[@RAHULRAJ-rv4ng]

@@happycoding1093 Hi, Where have you done the memoization ? You have just used the name of functon as DP.

[@learner_1228]

what is the time complexity of the this solution?

[@happycoding1093]

O(k^(N-k)*k!)

[@learner_1228]

@@happycoding1093 Could you explain it how? Shouldn't it be O((2^n)*k)? since we will include a particular/current element or not,therefore 2 choices for every element, we will do it for k times. Is this correct?