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

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

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

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

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

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

Continue reading## Disjoint Set | Union by Rank | Union by Size | Path Compression: G-46

In this article, we will discuss the Disjoint Set data structure which is a very important topic in the entire

Continue reading## Striver Graph Series : Top Graph Interview Questions

Part 1: Introduction to Graph Find both C++/Java codes of all problem in the articles in the first column. Topic

Continue reading## Minimum Spanning Tree – Theory: G-44

In this article, we will be discussing the minimum spanning tree. So, to understand the minimum spanning tree, we first

Continue reading## Find the City With the Smallest Number of Neighbours at a Threshold Distance: G-43

Problem Statement: There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi,weighti]

Continue reading