Problems

# Status Problem Level Completes Likes
1

Maximum Bipartite Matching Problem - Java

Hard % 0
2

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

Hard % 0
3

Check If Given Undirected Graph is a tree

Medium % 0
4

Articulation Points OR Cut Vertices in a Graph

Hard % 0
5

Find the number of distinct Islands OR connected components.

Hard % 1
7

Number of Islands using BFS

Medium % 0
8

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

Hard % 0
9

Check if given undirected graph is connected or not

Beginner % 0
10

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

Medium % 0
11

Maximum number edges to make Acyclic Undirected/Directed Graph

Beginner % 0
12

Breadth-First Search in Disconnected Graph

Medium % 0
13

Number of Islands

Medium % 0
14

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

Hard % 0
15

Introduction to Bipartite Graphs OR Bigraphs

Medium % 1
16

Reverse the Directed Graph

Beginner % 0
17

Determine the order of Tests when tests have dependencies on each other

Medium % 0
18

Implement Graph Using Map - Java

Medium % 0
19

Count number of subgraphs in a given graph

Beginner % 0
20

Check if given an edge is a bridge in the graph

Medium % 0
21

Max Flow Problem - Ford-Fulkerson Algorithm

Hard % 0
22

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

Hard % 0
23

Max Flow Problem – Introduction

Hard % 0
24

Dijkstra Algorithm Implementation – TreeSet and Pair Class

Hard % 0
25

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

Hard % 0
26

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

Hard % 0
27

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

Hard % 0
28

Dijkstra's – Shortest Path Algorithm (SPT)

Hard % 0
29

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

Hard % 0
30

Introduction to Minimum Spanning Tree (MST)

Medium % 0
31

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

Hard % 0
32

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

Hard % 0
33

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

Hard % 0
34

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

Hard % 0
35

Prim’s Algorithm - Minimum Spanning Tree (MST)

Hard % 0

Maximum Bipartite Matching Problem - Java

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

Determine the order of Tests when tests have dependencies on each other

Implement Graph Using Map - Java

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 and Pair Class

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

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

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

Dijkstra's – Shortest Path Algorithm (SPT)

Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java 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)