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 1045 / 1078 800
Brewing potion 2 879 / 951 800
Unique elements 751 / 810 800
Small range 542 / 608 800
Number of pairs 708 / 724 800
Sum of three values 543 / 646 900
Brewing potion 3 360 / 444 900
Brewing potion 4 340 / 356 900
Three sequences 298 / 305 1000
Biggest submatrix 240 / 262 1100
Choosing numbers 192 / 223 1200