Foundations
Computer Science Fundamentals
18 topics · 132h estimated
requires
helps
parallel
related
Click to focus · double-click or Enter to open · Esc to clear
This interactive graph isn't part of the printed page — see the topic list below (on a domain page) or visit this URL online to explore it.
Learning order
| # | Topic | Difficulty | Importance | Hours |
|---|---|---|---|---|
| 1 | Hash Tables | 8h | ||
| 2 | Complexity Analysis in Practice | 7h | ||
| 3 | Searching & Sorting | 9h | ||
| 4 | Trees | 9h | ||
| 5 | Backtracking | 8h | ||
| 6 | Heaps & Priority Queues | 7h | ||
| 7 | Sliding Window & Two Pointers | 6h | ||
| 8 | Stacks & Queues | 5h | ||
| 9 | Graph Algorithms | 10h | ||
| 10 | Memory, the Stack & the Heap | 7h | ||
| 11 | Bit Manipulation | 6h | ||
| 12 | Dynamic Programming | 9h | ||
| 13 | Greedy Algorithms | 7h | ||
| 14 | String Matching Algorithms | 7h | ||
| 15 | Tries | 6h | ||
| 16 | Union-Find (Disjoint Set) | 6h | ||
| 17 | Shortest Paths & Minimum Spanning Trees | 9h | ||
| 18 | Computability & the Halting Problem | 6h |