> For the complete documentation index, see [llms.txt](https://liuzhenglaichn.gitbook.io/algorithm/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://liuzhenglaichn.gitbook.io/algorithm/dynamic-programming/dp-on-subsets.md).

# 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)](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/)
* [473. Matchsticks to Square (Medium)](https://leetcode.com/problems/matchsticks-to-square/)
* [1723. Find Minimum Time to Finish All Jobs (Hard)](https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs/)

<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?