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 1083 / 1117 800
Brewing potion 2 905 / 976 800
Unique elements 774 / 834 800
Small range 561 / 628 800
Number of pairs 728 / 744 800
Sum of three values 557 / 661 900
Brewing potion 3 374 / 458 900
Brewing potion 4 352 / 368 900
Three sequences 309 / 316 1000
Biggest submatrix 251 / 272 1100
Choosing numbers 202 / 233 1200