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 761 / 787 800
Brewing potion 2 623 / 685 800
Unique elements 529 / 576 800
Small range 380 / 427 800
Number of pairs 502 / 516 800
Sum of three values 376 / 471 900
Brewing potion 3 233 / 313 900
Brewing potion 4 223 / 237 900
Three sequences 187 / 196 1000
Biggest submatrix 147 / 166 1100
Choosing numbers 118 / 139 1200