Concepts2
⚙️AlgorithmIntermediate
Meet in the Middle
Meet-in-the-middle splits a hard exponential search into two halves, enumerates each half, and then combines results efficiently.
#meet in the middle#subset sum#pair sums+12
⚙️AlgorithmIntermediate
Complete Search and Backtracking
Complete search enumerates every candidate solution, while backtracking prunes branches that cannot possibly lead to a valid or better solution.
#complete search#backtracking#recursion+12