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 484 / 496 800
Brewing potion 2 391 / 431 800
Unique elements 328 / 365 800
Small range 230 / 264 800
Number of pairs 315 / 327 800
Sum of three values 239 / 298 900
Brewing potion 3 144 / 195 900
Brewing potion 4 140 / 150 900
Three sequences 102 / 109 1000
Biggest submatrix 85 / 100 1100
Choosing numbers 63 / 73 1200