Lecture Videos

Biconnected components & DFS

Biconnected components & DFS

Traveling Salesperson Problem (Branch & Bound)

Traveling Salesperson Problem (Branch & Bound)

N-Queens (Backtracking)

N-Queens (Backtracking)

Backtracking: Recursive Algorithm

Backtracking: Recursive Algorithm

Backtracking: Introduction

Backtracking: Introduction

Dynamic Programming (0/1 Knapsack Problem)

Dynamic Programming (0/1 Knapsack Problem)

Travelling Salesperson Problem (Dynamic Programming)

Travelling Salesperson Problem (Dynamic Programming)

0/1 Knapsack Problem (Dynamic Programming)

0/1 Knapsack Problem (Dynamic Programming)

AVL Tree: Deletion

AVL Tree: Deletion

B Trees: Introduction

B Trees: Introduction

B-Tree Deletion

B-Tree Deletion

String Editing (Dynamic Programming)

String Editing (Dynamic Programming)

AVL Tree Double Rotation

AVL Tree Double Rotation

AVL Tree Rotations

AVL Tree Rotations

AVL Trees: Single Rotations

AVL Trees: Single Rotations

AVL Trees (Introduction)

AVL Trees (Introduction)

Optimal Binary Search Tree (Dynamic Programming)

Optimal Binary Search Tree (Dynamic Programming)

All Pairs Shortest Path (Dynamic Programming)

All Pairs Shortest Path (Dynamic Programming)

Multi Stage Graph Problem | Backward Approach | Dynamic Programming

Multi Stage Graph Problem | Backward Approach | Dynamic Programming

Multi Stage Graph Problem (Dynamic Programming)

Multi Stage Graph Problem (Dynamic Programming)

Fractional Knapsack (Greedy Approach)

Fractional Knapsack (Greedy Approach)

Single Source Shortest Path: Dijikstra's Algorithm (Greedy Approach)

Single Source Shortest Path: Dijikstra's Algorithm (Greedy Approach)

Algorithms: Greedy Approach - Single Source Shortest Path

Algorithms: Greedy Approach - Single Source Shortest Path

Algorithms: Minimum Cost Spanning Tree

Algorithms: Minimum Cost Spanning Tree

Greedy approach: Minimum Cost Spanning Tree

Greedy approach: Minimum Cost Spanning Tree

Algorithms: Greedy Approach

Algorithms: Greedy Approach