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 566 / 584 800
Brewing potion 2 464 / 507 800
Unique elements 395 / 435 800
Small range 282 / 318 800
Number of pairs 377 / 389 800
Sum of three values 282 / 355 900
Brewing potion 3 165 / 235 900
Brewing potion 4 171 / 183 900
Three sequences 116 / 126 1000
Biggest submatrix 99 / 117 1100
Choosing numbers 79 / 94 1200