Meta
Fast-paced coding rounds — two problems in 45 minutes is common — plus a product-minded design round and a dedicated behavioral round.
Typical loop
- 1Recruiter screen
- 2Phone screen: 1-2 coding problems
- 3Onsite: two coding rounds
- 4System or product design round
- 5Behavioral round
Practice questions
Merge Overlapping Intervals
Algorithms & Data Structures · Sort, then sweep — the pattern behind a dozen calendar problems.
Design an LRU Cache
Algorithms & Data Structures · Hash map plus doubly linked list, all operations O(1).
Implement debounce()
Frontend · Closures and timers, the frontend screen classic.
Design a News Feed
System Design · Fan-out on write vs. read, ranking, and the celebrity problem.
Build a Counter
Frontend · The React warm-up: state, events, and a derived disable.
Build a Todo List
Frontend · List state done right: keys, controlled input, and deletes.
Build Tabs
Frontend · One active index drives the whole component.
Asked on LeetCode
All 1,399 by time range →- Minimum Remove to Make Valid ParenthesesmediumStringStackfrequency 100.0
- Valid Word AbbreviationeasyTwo PointersStringfrequency 96.8
- Valid Palindrome IIeasyTwo PointersStringGreedyfrequency 95.1
- Binary Tree Vertical Order TraversalmediumHash TableTreeDepth-First SearchBreadth-First Search+2frequency 93.4
- Kth Largest Element in an ArraymediumArrayDivide and ConquerSortingHeap (Priority Queue)+1frequency 93.3
- Two SumeasyArrayHash Tablefrequency 90.2
- Basic Calculator IImediumMathStringStackfrequency 89.3
- Lowest Common Ancestor of a Binary Tree IIImediumHash TableTwo PointersTreeBinary Tree+2frequency 88.5