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 1276 / 1317 800
Brewing potion 2 1077 / 1155 800
Unique elements 903 / 970 800
Small range 652 / 727 800
Number of pairs 839 / 855 800
Sum of three values 653 / 763 900
Brewing potion 3 441 / 531 900
Brewing potion 4 411 / 427 900
Three sequences 373 / 380 1000
Biggest submatrix 297 / 319 1100
Choosing numbers 248 / 285 1200