Groups
Bitmask DP compresses the state of a subset of n elements into an integer mask, enabling elegant dynamic programming over all subsets.
Complete search enumerates every candidate solution, while backtracking prunes branches that cannot possibly lead to a valid or better solution.