4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming
18:31
5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search
28:24
4.5 0/1 Knapsack - Two Methods - Dynamic Programming
25:47
Longest Common Subsequence- Dynamic Programming | Data structures and algorithms
20:12
3.5 Prims and Kruskals Algorithms - Greedy Method
51:08
2.6.3 Heap - Heap Sort - Heapify - Priority Queues
13:41
6.1 N Queens Problem using Backtracking
17:44
3.4 Huffman Coding - Greedy Method
18:35