1. Linked List   

1. Introduction  

2. Singly Linked List  

2. Stack and Queues    

1. Introduction  

2. Linked List Implementation of Stack   

3. Linked List Implementation of Queue   

4. Circular Queue

5. Priority Queue

3. Tree    

1. Introduction  

2. Binary Search Tree  

3. AVL Tree

4. Red-Black Tree

5. Segment Tree  

6. Fenwick Tree (Binary Indexed Tree)    

4. Graph   

1. Introduction  

2. Graph Representations     

3. Graph Traversals    

5. Hash Table and Heaps

1.    Hash Table

2.    Heap 

6. Brute Force   

1. Introduction  

2. Linear Search 

3. Rain Terraces 

4. Recursive Staircase 

5. Maximum Subarray    

6. Travelling Salesman Problem     

7. Discrete Fourier Transform

7. Greedy  

1. Introduction  

2. Jump Game     

3. Unbound KnapSack Problem  

4. Dijkstra Algorithm  

5. Prim’s Algorithm    

6. Kruskal’s Algorithm 

8. Divide and Conquer  

1. Introduction  

2. Binary Search 

3. Tower of Hanoi

4. Pascal’s Triangle   

5. Euclidean Algorithm 

6. Merge Sort    

7. Quick Sort    

8. Fast Powering 

9. Dynamic Programming 

1. Introduction  

2. Fibonacci Number    

3. Unique Paths  

4. Longest Common Subsequence (LCS)

5. Longest Common Substring  

6. Longest Increasing Subsequence  

7. Shortest Common Super Sequence  

8. 0/1 Knapsack Problem

9. Integer Partition   

10. Regular Expression Matching    

10. Backtracking 

1.  Introduction 

2.  Power Set    

3.  Hamiltonian Cycle  

4.  N-Queens Problem   

5.  Knight’s Tour

6.  Combination Sum