6 Introduction to Backtracking - Brute Force Approach
13:41
6.1 N Queens Problem using Backtracking
18:31
5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search
24:42
7.3 Traveling Salesman Problem - Branch and Bound
31:53
8. NP-Hard and NP-Complete Problems
12:19
6.2 Sum Of Subsets Problem - Backtracking
51:08
2.6.3 Heap - Heap Sort - Heapify - Priority Queues
15:52
6.3 Graph Coloring Problem - Backtracking
18:56