# Status Problem video Level Completes Likes
506

Maximum Bipartite Matching Problem

Hard % 0
449

Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS)

Hard % 0
447

Check If Given Undirected Graph is a tree

Medium % 0
444

Articulation Points OR Cut Vertices in a Graph

Hard % 0
442

Find the number of distinct Islands OR connected components.

Hard % 0
427

Number of Islands using BFS

Medium % 0
426

Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS)

Hard % 0
424

Check if given undirected graph is connected or not

Beginner % 0
423

Given Graph - Remove a vertex and all edges connect to the vertex

Medium % 0
417

Maximum number edges to make Acyclic Undirected/Directed Graph

Beginner % 0
414

Breadth-First Search in Disconnected Graph

Medium % 0
408

Number of Islands

Medium % 1
403

Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS)

Hard % 0
401

Introduction to Bipartite Graphs OR Bigraphs

Medium % 0
400

Reverse the Directed Graph

Beginner % 0
396

Optimizing Test Execution: Managing Test Dependencies for Sequential Order

Medium % 0
395

Implement Graph Using Map or dictionary

Medium % 0
393

Count number of subgraphs in a given graph

Beginner % 0
391

Check if given an edge is a bridge in the graph

Medium % 0
368

Max Flow Problem - Ford-Fulkerson Algorithm

Hard % 0
347

Find the nearest building which has bike | Find nearest specific vertex from source in a graph.

Hard % 0
335

Max Flow Problem – Introduction

Hard % 0
334

Dijkstra Algorithm Implementation – TreeSet

Hard % 0
322

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation

Hard % 0
310

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap

Hard % 0
303

Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation

Hard % 0
297

Dijkstra's – Shortest Path Algorithm (SPT)

Hard % 0
287

Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Implementation

Hard % 0
286

Introduction to Minimum Spanning Tree (MST)

Medium % 0
285

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV)

Hard % 0
284

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key

Hard % 0
283

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap

Hard % 1
282

Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix

Hard % 0
281

Prim’s Algorithm - Minimum Spanning Tree (MST)

Hard % 0

Maximum Bipartite Matching Problem

Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS)

Check If Given Undirected Graph is a tree

Articulation Points OR Cut Vertices in a Graph

Find the number of distinct Islands OR connected components.

Number of Islands using BFS

Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS)

Check if given undirected graph is connected or not

Given Graph - Remove a vertex and all edges connect to the vertex

Maximum number edges to make Acyclic Undirected/Directed Graph

Breadth-First Search in Disconnected Graph

Number of Islands

Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS)

Introduction to Bipartite Graphs OR Bigraphs

Reverse the Directed Graph

Optimizing Test Execution: Managing Test Dependencies for Sequential Order

Implement Graph Using Map or dictionary

Count number of subgraphs in a given graph

Check if given an edge is a bridge in the graph

Max Flow Problem - Ford-Fulkerson Algorithm

Find the nearest building which has bike | Find nearest specific vertex from source in a graph.

Max Flow Problem – Introduction

Dijkstra Algorithm Implementation – TreeSet

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap

Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation

Dijkstra's – Shortest Path Algorithm (SPT)

Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Implementation

Introduction to Minimum Spanning Tree (MST)

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV)

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap

Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix

Prim’s Algorithm - Minimum Spanning Tree (MST)