## Number of Islands – II – Online Queries – DSU: G-51

Problem Statement: You are given an n, m which means the row and column of the 2D matrix, and an

## Number of Provinces – Disjoint Set: G-48

Problem Statement: Given an undirected graph with V vertices. We say two vertices u and v belong to a single

## Accounts Merge – DSU: G-50

Problem Statement: Given a list of accounts where each element account [ i ] is a list of strings, where

## Number of Operations to Make Network Connected – DSU: G-49.

Problem Statement: You are given a graph with n vertices and m edges. You can remove one edge from anywhere

## G-34: Dijkstra’s Algorithm (Intuition and Time Complexity Derivation)

Note: Please watch the previous two videos of this series in order to get an idea of the problem statement

## G-35 : Print Shortest Path – Dijkstra’s Algorithm

Problem Statement:  You are given a weighted undirected graph having n+1 vertices numbered from 0 to n and m edges

## Kruskal’s Algorithm – Minimum Spanning Tree : G-47

Problem Statement: Given a weighted, undirected, and connected graph of V vertices and E edges. The task is to find

## Prim’s Algorithm – Minimum Spanning Tree – C++ and Java: G-45

Problem Statement: Given a weighted, undirected, and connected graph of V vertices and E edges. The task is to find