The Real-Life Guide to Data Structures & Algorithms

Contents

28 chapters, one page each. Prefer one long page? Read the whole book on one page.

1. Why does this exist?1 min
2. 📏 Big-O Notation — "How Slow Does This Get?"
3. 🟢 BEGINNER
4. 1. Arrays1 min
5. 2. Strings1 min
6. 3. Linked Lists2 min
7. 4. Stacks1 min
8. 5. Queues1 min
9. 6. Linear Search1 min
10. 7. Bubble Sort1 min
11. 🟡 INTERMEDIATE
12. 8. Binary Search2 min
13. 9. Recursion1 min
14. 10. Hash Maps (a.k.a. Dictionaries / Hash Tables)2 min
15. 11. Trees2 min
16. 12. Binary Search Trees (BST)2 min
17. 13. Merge Sort & Quick Sort3 min
18. 14. Graphs1 min
19. 15. BFS & DFS (Graph/Tree Traversal)3 min
20. 🔴 ADVANCED
21. 16. Dynamic Programming (DP)2 min
22. 17. Greedy Algorithms2 min
23. 18. Backtracking3 min
24. 19. Heaps / Priority Queues2 min
25. 20. Union-Find (Disjoint Set)2 min
26. 21. Trie (Prefix Tree)2 min
27. 22. Dijkstra's Algorithm (Shortest Path)3 min
28. 23. Topological Sort3 min
29. Cheat Sheet: When Do I Use What?
30. The one-sentence version of everything1 min
31. 📚 Further Reading
32. Books1 min
33. Blogs & Written Guides1 min
34. Video Tutorials1 min