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 1424 / 1470 800
Brewing potion 2 1219 / 1298 800
Unique elements 1015 / 1089 800
Small range 737 / 815 800
Number of pairs 933 / 949 800
Sum of three values 732 / 851 900
Brewing potion 3 496 / 588 900
Brewing potion 4 459 / 476 900
Three sequences 412 / 420 1000
Biggest submatrix 321 / 345 1100
Choosing numbers 275 / 313 1200