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¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, backtracking, bit manipulation, memoization, bitmask
1411. Number of Ways to Paint N × 3 Grid¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: dynamic programming
2002. Maximum Product of the Length of Two Palindromic Subsequences¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: string, dynamic programming, backtracking, bit manipulation, bitmask
473. Matchsticks to Square¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, backtracking, bit manipulation, bitmask
1931. Painting a Grid With Three Different Colors¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: dynamic programming
1125. Smallest Sufficient Team¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, bitmask
1434. Number of Ways to Wear Different Hats to Each Other¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, bitmask
464. Can I Win¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: math, dynamic programming, bit manipulation, memoization, game theory, bitmask
691. Stickers to Spell Word¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, hash table, string, dynamic programming, backtracking, bit manipulation, memoization, bitmask
3276. Select Cells in Grid With Maximum Score¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, matrix, bitmask
1595. Minimum Cost to Connect Two Groups of Points¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, matrix, bitmask
1815. Maximum Number of Groups Getting Fresh Donuts¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, memoization, bitmask
1659. Maximize Grid Happiness¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: dynamic programming, bit manipulation, memoization, bitmask
351. Android Unlock Patterns¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: dynamic programming, backtracking, bit manipulation, bitmask
2184. Number of Ways to Build Sturdy Brick Wall¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, bit manipulation, bitmask