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 1410 / 1456 800
Brewing potion 2 1209 / 1288 800
Unique elements 1005 / 1079 800
Small range 730 / 808 800
Number of pairs 925 / 941 800
Sum of three values 726 / 844 900
Brewing potion 3 493 / 585 900
Brewing potion 4 458 / 475 900
Three sequences 411 / 419 1000
Biggest submatrix 320 / 344 1100
Choosing numbers 272 / 311 1200