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 1387 / 1433 800
Brewing potion 2 1180 / 1260 800
Unique elements 981 / 1055 800
Small range 718 / 794 800
Number of pairs 914 / 930 800
Sum of three values 720 / 838 900
Brewing potion 3 483 / 576 900
Brewing potion 4 446 / 463 900
Three sequences 403 / 411 1000
Biggest submatrix 317 / 340 1100
Choosing numbers 266 / 305 1200