Essential Books
0 Getting started
1 Sorting
2 Bubble sort
3 Algorithm complexity
4 Graphs
5 Dynamic programming
6 Kruskals algorithm
7 Greedy algorithms
8 Searching
9 Big O notation
10 Bellman-For Algorithm
11 Merge Sort
12 Binary Search Trees
13 Trees
14 Insertion Sort
15 Hash Functions
16 Traveling Salesman
17 Substring Search
18 Dijkstras Algorithm
19 Floyd-Warshall Algorithm
20 Breadth-First Search
21 Bucket Sort
22 Quicksort
23 Depth-First Search
24 Knapsack Problem
25 Counting Sort
26 Cycle Sort
27 Heap Sort
28 Prims Algorithm
29 Matrix Exponentiation
30 Pigeonhole Sort
31 Radix Sort
32 Equation Solving
33 Odd-Even Sort
34 Pseudocode
35 Catalan Number Algorithm
36 Integer Partition Algorithm
37 A* Pathfinding
38 Shell Sort
39 Selection Sort
40 Pancake Sort
41 Longest Common Subsequence
42 Longest Increasing Subsequence
43 Maximum Path Sum Algorithm
44 Maxiumum Subarray Algorithm
45 Dynamic Time Warping
46 Pascal Triangle
47 Line drawing
48 Shortest Common Supersequence
49 Sliding Window Algorithm
50 Application of greedy techniqe
51 Online algorithms
52 Fast Fourier Transform
53 A* Path-finding Algorithm
54 Check if tree is BST
55 Binary tree traversal
56 Lowest common ancestor of a binary tree
57 Graph Traversal
58 Minimum Vertex Cover
59 Multi-threaded Algorithms
60 Print MxN matrix in square wise
61 Check two strings are anagrams
62 Edit Distance Dynamic Algorithm
63 Applications of Dynamic Programming
64 Knuth Moriss Pratt
65 Contributors