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 618 / 639 800
Brewing potion 2 509 / 555 800
Unique elements 433 / 474 800
Small range 314 / 354 800
Number of pairs 419 / 432 800
Sum of three values 311 / 391 900
Brewing potion 3 186 / 263 900
Brewing potion 4 186 / 199 900
Three sequences 137 / 148 1000
Biggest submatrix 112 / 130 1100
Choosing numbers 90 / 106 1200