In this article, we will discuss the Disjoint Set data structure which is a very important topic in the entire
Continue readingCategory: Data Structure
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 readingFind 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 readingFloyd Warshall Algorithm: G-42
Problem Statement: The problem is to find the shortest distances between every pair of vertices in a given edge-weighted directed
Continue readingBellman Ford Algorithm: G-41
Problem Statement: Given a weighted, directed and connected graph of V vertices and E edges, Find the shortest distance of
Continue readingDijkstra’s Algorithm – Using Set : G-33
Given a weighted, undirected, and connected graph of V vertices and an adjacency list adj where adj[i] is a list
Continue readingDijkstra’s Algorithm – Using Priority Queue : G-32
Given a weighted, undirected, and connected graph of V vertices and an adjacency list adj where adj[i] is a list
Continue readingAlien Dictionary – Topological Sort: G-26
Problem Statement: Given a sorted dictionary of an alien language having N words and k starting alphabets of a standard
Continue readingFind Eventual Safe States – BFS – Topological Sort: G-25
Problem Statement: A directed graph of V vertices and E edges is given in the form of an adjacency list
Continue readingCourse Schedule I and II | Pre-requisite Tasks | Topological Sort: G-24
Problem Statement I (Course Schedule): There are a total of n tasks you have to pick, labeled from 0 to
Continue reading