##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
TSP, assignments, partitions
Bitmask DP solves problems where you need to track which elements from a small set () have been selected. Classic examples include TSP, assignment problems, and counting valid arrangements.
This works because an integer with bits can represent any subset of elements. Bit being means element is included. This gives possible states, which is manageable for small .
