Meet-in-the-middle

Problems on meet-in-the-middle, including subset sums over forty items, splitting a search into two halves and combining them, zero XOR subsets, and paths that meet in the middle of a grid.

The backtracking and binary search articles in the Basics section cover the two halves of the technique. Related problem sets are under Brute force and Bitmasks.