A structured, mentor-crafted guide to land senior backend roles at Microsoft, Grab, WorldQuant, Anduin & Vietnam's top tech companies.
From DSA fundamentals to distributed systems mastery. Each month builds on the last — follow the sequence.
Each company has unique culture, process, and technical focus. Click to see insider tips and key topics.
Click any card to reveal the answer. Build fluency by explaining concepts aloud before checking.
Focused, high-signal resources. Don't read everything — read the right things.
| Operation | Time | Space |
|---|---|---|
| Array access | O(1) | O(1) |
| Hash map get/set | O(1) avg | O(n) |
| Binary search | O(log n) | O(1) |
| Sort (comparison) | O(n log n) | O(log n) |
| Tree DFS/BFS | O(n) | O(h) |
| Dijkstra | O(E log V) | O(V) |
| Heapify | O(n) | O(1) |
| Edit Distance DP | O(mn) | O(mn) |
subarray → Sliding Window / Prefix Sumpairs / triplets → Two Pointers / Hash Maptree / graph traversal → DFS / BFSshortest path → BFS (unweighted) / Dijkstra (weighted)top-K → Heapsorted order required → BST / Sorted listoverlapping subproblems → DPall combinations → Backtrackingordering with deps → Topological Sortconnected components → Union-Find / DFSprefix search → Trieminimized max / maximized min → Binary Search on answer