1. Most companies follow the “25% Easy / 50% Medium / 25% Hard” complexity distribution in tagged LeetCode sets. Google leans heavier into Medium–Hard.
2. Top topics across firms remain consistent: Arrays, Strings, Search/Sorting, Hash Tables, Trees, Graphs, Dynamic Programming.
3. Reddit users emphasize variability—Amazon’s OA lists include many high‑frequency “hard” tagged problems, but onsite rounds often only medium.
4. Google heavily focuses on communication and problem‑solving process rather than direct reuse of tagged questions:
“For Google it's almost useless, since they do their best to ban leaked questions.”
| Company | Easy (~25%) | Medium (~50%) | Hard (~25%) |
|---|---|---|---|
| Amazon | Arrays, Strings, Hash‑table basics, Trees | Sliding window, Two‑pointers, Heap/Greedy, Graph BFS/DFS | Advanced trees, DP (Coin Change, Edit Distance), Graph clones |
| Basic Binary Search, Hashmap lookups | Graph (number of islands), Trie, Recursion/backtracking | DP (edit‑distance, word break), Graph (alien dictionary), Union‑Find | |
| Meta | Array merging, Strings (anagram), Stack basics | LinkedList cycle, Binary Tree traversal, HashMap design | Graph backtracking (Word Search II), Trie + DFS, Monotonic stack (histogram) |
| Microsoft | Arrays, Strings, Sorting fundamentals | Binary Trees, DP (climbing stairs, coin change), Sorting + Greedy | Graph (Course Schedule), Tree DP, Bit manipulation |
| Apple | Binary Search basics, Recursion basics | Heap (Top‑k), Tree traversal, Sorting and interval merging | DP (Burst Balloons), Bitmask DP (TSP), Graph coloring |
| Netflix | Simple HashMap, Strings | Sliding Window, Greedy (Candy, Jump Game), DP (substrings) | DP & bitmask (TSP, regex match), Monotonic Stack grids |
Comments (0)