Meet in the Middle
Halve the exponent by splitting the search.
When Brute Force Is Too Slow
Some problems have N around 40, where trying all 2^N subsets is hopeless. Meet in the middle rescues these mid-size cases. 🤝
The Core Idea
Split the input into two halves. Solve each half by brute force, then cleverly combine the two partial results.