Note that the following problems can also be solved using DFS + Pruning tricks.
698. Partition to K Equal Sum Subsets (Medium)arrow-up-right
473. Matchsticks to Square (Medium)arrow-up-right
1723. Find Minimum Time to Finish All Jobs (Hard)arrow-up-right
https://leetcode.com/discuss/general-discussion/1125779/dynamic-programming-on-subsets-with-examples-explainedarrow-up-right
Q: Merge bitmask dp into this?
Q: can this be merged with traveling salesperson problem?
Last updated 4 years ago