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 767 / 794 800
Brewing potion 2 625 / 687 800
Unique elements 533 / 580 800
Small range 381 / 428 800
Number of pairs 507 / 521 800
Sum of three values 379 / 473 900
Brewing potion 3 234 / 314 900
Brewing potion 4 224 / 238 900
Three sequences 189 / 198 1000
Biggest submatrix 148 / 167 1100
Choosing numbers 118 / 140 1200