Algorithms and Implementation

---

L2

1. Merge Sort
2. Quick Sort
3. Knapsack (DP)
4. Longest Common Subsequence (DP)
5. Activity Selection Sort
6. Haffman Coding
7. nQueen (Backtracking)
8. Graph Traverse (BFS, DFS)
9. Minimum Spanning Tree (Prims Algorithm)
   10.Minimum Spanning Tree (Kruskal Algorithm)

L3

1. Coin Change
2. Edit Distance
3. Sum of Subset
4. Optimal Binary Search Tree

N3

1. Consolidation Benefit