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 1035 / 1068 800
Brewing potion 2 871 / 944 800
Unique elements 743 / 802 800
Small range 535 / 600 800
Number of pairs 700 / 717 800
Sum of three values 535 / 639 900
Brewing potion 3 357 / 439 900
Brewing potion 4 336 / 352 900
Three sequences 293 / 300 1000
Biggest submatrix 235 / 257 1100
Choosing numbers 188 / 219 1200