DP Other State Compression¶
Table of Contents¶
- 698. Partition to K Equal Sum Subsets (Medium)
- 1411. Number of Ways to Paint N × 3 Grid (Hard)
- 2002. Maximum Product of the Length of Two Palindromic Subsequences (Medium)
- 473. Matchsticks to Square (Medium)
- 1931. Painting a Grid With Three Different Colors (Hard)
- 1125. Smallest Sufficient Team (Hard)
- 1434. Number of Ways to Wear Different Hats to Each Other (Hard)
- 464. Can I Win (Medium)
- 691. Stickers to Spell Word (Hard)
- 3276. Select Cells in Grid With Maximum Score (Hard)
- 1595. Minimum Cost to Connect Two Groups of Points (Hard)
- 1815. Maximum Number of Groups Getting Fresh Donuts (Hard)
- 1659. Maximize Grid Happiness (Hard)
- 351. Android Unlock Patterns (Medium) 👑
- 2184. Number of Ways to Build Sturdy Brick Wall (Medium) 👑
698. Partition to K Equal Sum Subsets¶
-
Tags: Array, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask
1411. Number of Ways to Paint N × 3 Grid¶
2002. Maximum Product of the Length of Two Palindromic Subsequences¶
473. Matchsticks to Square¶
1931. Painting a Grid With Three Different Colors¶
1125. Smallest Sufficient Team¶
1434. Number of Ways to Wear Different Hats to Each Other¶
464. Can I Win¶
691. Stickers to Spell Word¶
-
Tags: Array, Hash Table, String, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask