Bitmask
1 problems
Bitmask DP represents a subset of n items as a single integer (bit i = 1 means item i is included). Enables O(2ⁿ · n) DP over all subsets — practical up to n ≈ 20. Classic: Travelling Salesman, covering problems, and assignment problems.