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 1375 / 1420 800
Brewing potion 2 1168 / 1248 800
Unique elements 974 / 1049 800
Small range 716 / 791 800
Number of pairs 908 / 924 800
Sum of three values 716 / 834 900
Brewing potion 3 479 / 572 900
Brewing potion 4 442 / 459 900
Three sequences 399 / 407 1000
Biggest submatrix 314 / 336 1100
Choosing numbers 264 / 303 1200