State DP Problems
About 2 min
State DP Problems
| Problem ID | Title | Solution | Tags | Difficulty |
|---|---|---|---|---|
| 1879 | Minimum XOR Sum of Two Arrays | [[LeetCode XXXX]] | Bit Manipulation, Array, Dynamic Programming, State Compression | Hard |
| 2172 | Maximum AND Sum of Array | [[LeetCode XXXX]] | Bit Manipulation, Array, Dynamic Programming, State Compression | Hard |
| 1947 | Maximum Compatibility Score Sum | [[LeetCode XXXX]] | Bit Manipulation, Array, Dynamic Programming, Backtracking, State Compression | Medium |
| 1595 | Minimum Cost to Connect Two Groups of Points | [[LeetCode XXXX]] | Bit Manipulation, Array, Dynamic Programming, State Compression, Matrix | Hard |
| 1494 | Parallel Courses II | Bit Manipulation, Graph, Dynamic Programming, State Compression | Hard | |
| 1655 | Distribute Repeating Integers | Bit Manipulation, Array, Dynamic Programming, Backtracking, State Compression | Hard | |
| 1986 | Minimum Number of Work Sessions to Finish the Tasks | [[LeetCode XXXX]] | Bit Manipulation, Array, Dynamic Programming, Backtracking, State Compression | Medium |
| 1434 | Number of Ways to Wear Different Hats to Each Other | Bit Manipulation, Array, Dynamic Programming, State Compression | Hard | |
| 1799 | Maximize Score After N Operations | Bit Manipulation, Array, Math, Dynamic Programming, Backtracking, State Compression, Number Theory | Hard | |
| 1681 | Minimum Incompatibility | Bit Manipulation, Array, Dynamic Programming, State Compression | Hard | |
| 0526 | Beautiful Arrangement | [[LeetCode XXXX]] | Bit Manipulation, Array, Dynamic Programming, Backtracking, State Compression | Medium |
| 0351 | Android Unlock Patterns | [[LeetCode XXXX]] | Dynamic Programming, Backtracking | Medium |
| 0464 | Can I Win | [[LeetCode XXXX]] | Bit Manipulation, Memoization, Math, Dynamic Programming, State Compression, Game Theory | Medium |
| 0847 | Shortest Path Visiting All Nodes | [[LeetCode XXXX]] | Bit Manipulation, Breadth-First Search, Graph, Dynamic Programming, State Compression | Hard |
| 0638 | Shopping Offers | Bit Manipulation, Memoization, Array, Dynamic Programming, Backtracking, State Compression | Medium | |
| 1994 | The Number of Good Subsets | [[LeetCode XXXX]] | Bit Manipulation, Array, Math, Dynamic Programming, State Compression | Hard |
| 1349 | Maximum Students Taking Exam | [[LeetCode XXXX]] | Bit Manipulation, Array, Dynamic Programming, State Compression, Matrix | Hard |
| 0698 | Partition to K Equal Sum Subsets | [[LeetCode XXXX]] | Bit Manipulation, Memoization, Array, Dynamic Programming, Backtracking, State Compression | Medium |
| 0943 | Find the Shortest Superstring | Bit Manipulation, Array, String, Dynamic Programming, State Compression | Hard | |
| 0691 | Stickers to Spell Word | [[LeetCode XXXX]] | Bit Manipulation, Array, String, Dynamic Programming, Backtracking, State Compression | Hard |
| 0982 | Triples with Bitwise AND Equal To Zero | [[LeetCode XXXX]] | Bit Manipulation, Array, Hash Table | Hard |