Module Introduction to meet in the middle

Introduction to meet in the middle

**Frequency: 1/10** This technique divides the search space into two. This technique can improve naive backtracking, help to solve problems with higher constraint (for example $n=40$ instead of $20$). May appear as a subtask in OI style contest.

Resources

- [USACO Guide: Meet in the middle](https://usaco.guide/gold/meet-in-the-middle)

Problems

Subset sum 2 219 / 270 800
Sum of four values 135 / 167 800
Robot 115 / 130 900
Minimum difference 111 / 154 900
Maximum sum subset 89 / 112 1000
Stealing books 95 / 108 1000