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 1419 / 1465 800
Brewing potion 2 1217 / 1296 800
Unique elements 1011 / 1085 800
Small range 731 / 810 800
Number of pairs 927 / 944 800
Sum of three values 728 / 846 900
Brewing potion 3 494 / 586 900
Brewing potion 4 458 / 475 900
Three sequences 412 / 420 1000
Biggest submatrix 321 / 345 1100
Choosing numbers 274 / 312 1200