DP Subset State Compression¶
Table of Contents¶
- 2305. Fair Distribution of Cookies (Medium)
- 1986. Minimum Number of Work Sessions to Finish the Tasks (Medium)
- 1723. Find Minimum Time to Finish All Jobs (Hard)
- 1655. Distribute Repeating Integers (Hard)
- 1349. Maximum Students Taking Exam (Hard)
- 1681. Minimum Incompatibility (Hard)
- 3444. Minimum Increments for Target Multiples in an Array (Hard)
- 2572. Count the Number of Square-Free Subsets (Medium)
- 1994. The Number of Good Subsets (Hard)
- 1494. Parallel Courses II (Hard)
- 465. Optimal Account Balancing (Hard) 👑
- 2152. Minimum Number of Lines to Cover Points (Medium) 👑
2305. Fair Distribution of Cookies¶
1986. Minimum Number of Work Sessions to Finish the Tasks¶
1723. Find Minimum Time to Finish All Jobs¶
1655. Distribute Repeating Integers¶
1349. Maximum Students Taking Exam¶
1681. Minimum Incompatibility¶
3444. Minimum Increments for Target Multiples in an Array¶
2572. Count the Number of Square-Free Subsets¶
1994. The Number of Good Subsets¶
1494. Parallel Courses II¶
465. Optimal Account Balancing¶
2152. Minimum Number of Lines to Cover Points¶
-
Tags: Array, Hash Table, Math, Dynamic Programming, Backtracking, Bit Manipulation, Geometry, Bitmask