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 709 / 734 800
Brewing potion 2 577 / 634 800
Unique elements 489 / 537 800
Small range 357 / 403 800
Number of pairs 471 / 485 800
Sum of three values 350 / 438 900
Brewing potion 3 214 / 292 900
Brewing potion 4 208 / 221 900
Three sequences 168 / 177 1000
Biggest submatrix 134 / 153 1100
Choosing numbers 109 / 127 1200