Dp On Subsets

DP on Subsets

Problems

Note that the following problems can also be solved using DFS + Pruning tricks.

• 698. Partition to K Equal Sum Subsets (Medium)

• 473. Matchsticks to Square (Medium)

• 1723. Find Minimum Time to Finish All Jobs (Hard)

https://leetcode.com/discuss/general-discussion/1125779/dynamic-programming-on-subsets-with-examples-explained

Q: Merge bitmask dp into this?

Q: can this be merged with traveling salesperson problem?