Lecture 57 || BFS for disconnected graph

Lecture - 7 Find row with Max no. of 1s in Matrix (Binary Search)

Lecture -6 Find no. of occurrences of an element in a sorted array

Lecture -5 Find first and last occurrence of an element in a sorted array (Binary Search)

Lecture 4 - Searching Algos (Binary Search)

Lecture 3 - Searching Algos (Linear search)

Lecture -2 Asymptotic analysis of Algorithms

Lecture -1 Introduction to Algorithms

Lecture 57 || BFS for disconnected graph

Lecture 56 || Depth First traversal of Graph

Lecture 55 || Breadth First Search in Graph

How does a project gets executed in a software company??

Lecture 54 || Adjacency matrix implementation of graph