Hash maps
Five interview problems where a dict or a set turns a search into one lookup: pair sums, the first unique character, groups of anagrams, the longest streak and runs that add up.
- You build
- pairs.py, then unique.py, then anagrams.py, then streaks.py, then subarrays.py
- Stages
- 5 Problems
- Time
- About 1.5 hours
Loading the workspace…
Loading the workspace…