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 696 / 720 800
Brewing potion 2 569 / 622 800
Unique elements 483 / 529 800
Small range 350 / 396 800
Number of pairs 465 / 479 800
Sum of three values 346 / 435 900
Brewing potion 3 206 / 285 900
Brewing potion 4 203 / 216 900
Three sequences 165 / 174 1000
Biggest submatrix 131 / 150 1100
Choosing numbers 107 / 125 1200