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 492 / 504 800
Brewing potion 2 404 / 443 800
Unique elements 341 / 378 800
Small range 242 / 275 800
Number of pairs 329 / 340 800
Sum of three values 252 / 310 900
Brewing potion 3 149 / 205 900
Brewing potion 4 148 / 158 900
Three sequences 107 / 114 1000
Biggest submatrix 89 / 104 1100
Choosing numbers 67 / 77 1200