Learning Path
01. Call-stack / Recursion02. Iterative-approach / Recursion
03. Memoization / Recursion
04. Head-tail / Recursion
05. Minimax / Decision-making
06. Binary Search / Divide-conquer
07. Quicksort / Divide-conquer
08. Merge Sort / Comparision-based
09. Karatsuba Multiplication / Divide-conquer
10. Flood-fill / Graph-traversal
11. Arrays, Sets / Data-structures
12. Time Complexity / Data-structures
13. Hash-tables / Data-structures
14. Stacks / Data-structures
15. Queues / Data-structures
16. Linked-lists / Data-structures
17. Binary-search-trees / Data-structures
18. Tries / Data-structures
19. Graphs / Data-structures
20. Depth First Search / Graph-traversal
21. Breadth First Search / Graph-traversal
22. Dijkstra's Algorithm / Graph-traversal
23. Trees / Data-structures
24. Coin Change / Greedy
25. Fractional Knapsack / Greedy
26. Bubble Sort / Comparision-based
27. Selection Sort / Comparision-based
