union-find

55 posts

Queries to Count Tree Paths With Limited Maximum Edge Weight

Last Updated: 09 October 2026

Given a weighted tree with n nodes and n - 1 edges, where each edge is represented as [u, v, w] indicating an edge between nodes u and v with weight w.You are also given a...read more

DSA

Trees

union-find

Merge Details of Students

Last Updated: 24 September 2026

Given a 2D list details[][], where each row contains a student's name followed by their email addresses. Two details belong to the same student if they have at least one e...read more

Geeks Premier League 2023

Email Account Merging

Last Updated: 23 July 2025

Given a 2D array arr[][], where each element arr[i] is an array of strings representing an account, where the first element arr[i][0] is a name, and the rest of the elemen...read more

Check if given graph is connected or not after removal of ith node sequential

Last Updated: 23 July 2025

Given an undirected graph with N nodes, M edges given by array edges[][2] and permutation array A[] of size N which indicates the order in which each and every node of gra...read more

Geeks Premier League 2023

Maximum Nodes removed to Keep the Graph Reachable

Last Updated: 23 July 2025

You and your Friend are given an undirected graph having 3 types of edges. A graph is called Reachable if starting from any node, you and your friend can reach all other n...read more

Geeks Premier League 2023

Extra Edge in a Directed Rooted Tree

Last Updated: 23 July 2025

Given a Directed rooted tree of N vertices and N-1 edges. But now your friend has added an extra edge in the tree. You have to find an edge that could have been added by y...read more

Geeks Premier League 2023

Find the size of the Largest connected GCD Component

Last Updated: 23 July 2025

Given an array arr of size N. Consider a graph formed using the given array where the graph has N vertices and the value of i'th vertices is arr[i] there is an edge betwee...read more

Geeks Premier League 2023

Extra Edge in an Undirected Tree

Last Updated: 23 July 2025

Given an undirected tree of N vertices and N-1 edges. But now a friend has added an extra edge to the tree. You have to find an edge that your friend could have added. If ...read more

Geeks Premier League 2023

Determining Word Equivalence between Arrays

Last Updated: 23 July 2025

Given two arrays A[] and B[] of strings and an array of pairs[] where each pair of words is equivalent and also follows transitive property (i.e. if x=y and y=z then x=z),...read more

Geeks Premier League 2023

Validate the Binary Tree Nodes

Last Updated: 23 July 2025

Given N nodes numbered from 0 to n-1, also given the E number of directed edges, determine whether the given nodes all together form a single binary tree or not.Examples:I...read more

Geeks Premier League 2023

Graph Connectivity above Threshold value

Last Updated: 23 July 2025

Given two integers N and K, where N denotes the number of vertices in a Graph. There is an edge between two vertices u and v if there exists some z K: u % z ==0: v % z ==...read more

Geeks Premier League 2023

Number of Critical and Pseudo-Critical edges

Last Updated: 23 July 2025

Given a weighted undirected graph with n vertices numbered from 0 to n - 1, and an array of edges where edges[i] = [u, v, weight] represents a bidirectional and weighted e...read more

Friendship Request Validation in a Network

Last Updated: 23 July 2025

You have a network of individuals, each labeled with a number from 0 to n - 1. Some individuals cannot be friends due to specific rules. You also have a list of friend req...read more

Graph

DSA

union-find

Data Structures-Graph

Query-Based Array Transformation

Last Updated: 17 December 2023

Given an array arr[] of size N, initially, all the elements of arr are 0, you have to process q queries of the form "L R X" denoting that fill the array from index l to in...read more

Picked

DSA

union-find

Island Connectivity for Q queries

Last Updated: 23 July 2025

Given an integer N denoting the number of disconnected islands from 1 to N. You have to process Q queries of the following types:Type 1 query: 0 u v = Connect islands u an...read more

1 2 3 4