Concepts3

Bitmask DP compresses the state of a subset of n elements into an integer mask, enabling elegant dynamic programming over all subsets.

Bitmask DP subset enumeration lets you iterate all submasks of a given mask using the idiom for (s = mask; s > 0; s = (s - 1) & mask).

Dynamic Programming (DP) state design is the art of choosing what information to remember so that optimal substructure can be reused efficiently.