## Articulation Point in Graph: G-56

Problem Statement: Given an undirected connected graph with V vertices and adjacency list adj. You are required to find all

## Most Stones Removed with Same Row or Column – DSU: G-53

Problem Statement: There are n stones at some integer coordinate points on a 2D plane. Each coordinate point may have

## Making a Large Island – DSU: G-52

Problem Statement: You are given an n x n binary grid. A grid is said to be binary if every

## 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