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 1280 / 1321 800
Brewing potion 2 1083 / 1162 800
Unique elements 905 / 972 800
Small range 653 / 729 800
Number of pairs 841 / 857 800
Sum of three values 655 / 764 900
Brewing potion 3 444 / 534 900
Brewing potion 4 415 / 431 900
Three sequences 377 / 384 1000
Biggest submatrix 298 / 320 1100
Choosing numbers 250 / 287 1200