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 940 / 976 800
Brewing potion 2 790 / 858 800
Unique elements 671 / 727 800
Small range 485 / 545 800
Number of pairs 634 / 648 800
Sum of three values 481 / 583 900
Brewing potion 3 313 / 397 900
Brewing potion 4 299 / 314 900
Three sequences 256 / 264 1000
Biggest submatrix 208 / 229 1100
Choosing numbers 163 / 193 1200