##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Splitting search to reduce complexity.
Meet in the middle: split problem, solve halves, combine.
Subset sum: Find if any subset sums to target.
Brute force: subsets. . Too slow.
Meet in middle: Split into halves of .
Generate sums each.
For sum in first, check if in second (hash set).
Time: . For : . Feasible.
