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¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, backtracking, bit manipulation, bitmask
1986. Minimum Number of Work Sessions to Finish the Tasks¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, backtracking, bit manipulation, bitmask
1723. Find Minimum Time to Finish All Jobs¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, backtracking, bit manipulation, bitmask
1655. Distribute Repeating Integers¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, backtracking, bit manipulation, bitmask
1349. Maximum Students Taking Exam¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, matrix, bitmask
1681. Minimum Incompatibility¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, bitmask
3444. Minimum Increments for Target Multiples in an Array¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, dynamic programming, bit manipulation, number theory, bitmask
2572. Count the Number of Square-Free Subsets¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, math, dynamic programming, bit manipulation, bitmask
1994. The Number of Good Subsets¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, dynamic programming, bit manipulation, bitmask
1494. Parallel Courses II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: dynamic programming, bit manipulation, graph, bitmask
465. Optimal Account Balancing¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, backtracking, bit manipulation, bitmask
2152. Minimum Number of Lines to Cover Points¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, hash table, math, dynamic programming, backtracking, bit manipulation, geometry, bitmask