Problem Statement: You are given an n, m which means the row and column of the 2D matrix, and an
Continue readingCategory: Graph
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
Continue readingAccounts Merge – DSU: G-50
Problem Statement: Given a list of accounts where each element account [ i ] is a list of strings, where
Continue readingNumber 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 readingG-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 readingG-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 readingKruskal’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 readingPrim’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 readingDisjoint 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 readingStriver 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