Bitmasks

Problems on bitmasks, including enumerating all subsets of a small set, dynamic programming over subsets, states of lights and switches, assignment and covering problems with up to twenty items, and puzzles where each cell is on or off.

The bitmasks article in the Basics section explains how to store and iterate over subsets. Related problem sets are under Bitwise operations, Brute force and Dynamic programming.