Back To Algo Basics

A much needed post because I kept struggling to write this down altogether in a single place!

Complete list of topics to revise

1. Binary Search
2. DFS
3. BFS
4. Stack
5. Topological Sort
6. Dijsktra
7. MST algorithm (Prims and Kruskals)
8. Rabin Karp
9. Bipartite Graphs
10. Union-Find
11. Segment Tree/Fenwick Tree
12. Flood-Fill
13. Tarjan/Kosaraju Algorithm
14. Bellman-Ford
15. Euler Circuit/Euler Path
16. TSP/Bitmask DP
17. Catalan Numbers
18. Binomial Coefficient
19. Graph Cycle Detection
20. Permutations/Backtracking
21. KnapSack
22. LIS
23. LCS
24. Subset Sum
25. Coin Change (All variations)
26. Edit Dist/Regex
27. Kadane
28. Game Theory/Min Max Algorithm (cat and mouse)
29. Convex Hull
30. Stars and Bars
31. Robot Problems
32. DP Matrix Problems
33. Sliding Window
34. BST (insert/delete)
35. Inorder, Preorder, Postorder tree traversals
36. Serialize /Deserialize BST
37. LCA
38. Interval Scheduling Problem
39. Merge Intervals
40. Sorting
41. Advanced Binary Search Problems
42. Trie
43. Floyd Warshall
44. Advanced Graph Problems
45. Probability
46. Trapping rain water / histogram area problem
47. NP Complete problems
48. Line sweep
49. KMP

Notes (from CP 3 book):

• Graph
• Mathematics
• String processing
• Computational Geometry
• Advanced/Rare topics

Notes (from Kleinberg and Tardos)

Notes (from CTCI)

Notes (from GeeksForGeeks)

Notes (from LeetCode)