Module Introduction to two pointers

Introduction to two pointers

**Frequency: 6/10** Help lowering time and memory complexity. In some cases, two pointers can be used instead of binary search.

Resources

- [USACO Guide: Two pointers](https://usaco.guide/silver/two-pointers)

Problems

Merge array 981 / 1015 800
Brewing potion 2 827 / 898 800
Unique elements 697 / 756 800
Small range 501 / 565 800
Number of pairs 657 / 672 800
Sum of three values 500 / 604 900
Brewing potion 3 333 / 416 900
Brewing potion 4 314 / 330 900
Three sequences 270 / 278 1000
Biggest submatrix 220 / 240 1100
Choosing numbers 176 / 206 1200