Patterns: hashing, pointers, windows, binary search
Episode 16 Arrays & Hashing II
▶ This video is coming to YouTube soon.
You'll be able to solve LeetCode 49, 347, 128 and 238 by brute force, better and best approaches: picking a map key, bucketing by count, starting runs only where x − 1 is missing, and prefix/suffix products.
Quiz: test yourself
The 3 questions from the end of the episode. Pick an answer to see why it's right.