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 909 / 944 800
Brewing potion 2 765 / 832 800
Unique elements 651 / 705 800
Small range 462 / 521 800
Number of pairs 609 / 623 800
Sum of three values 461 / 562 900
Brewing potion 3 301 / 381 900
Brewing potion 4 287 / 302 900
Three sequences 243 / 251 1000
Biggest submatrix 192 / 214 1100
Choosing numbers 152 / 181 1200