Skip to content

Topic: Union Find

71 problems
TitleStatusDifficulty
Longest Consecutive Sequence—Medium
Surrounded Regions—Medium
Number of Islands—Medium
Graph Valid Tree—Medium
Number of Connected Components in an Undirected Graph—Medium
Evaluate Division—Medium
Number of Provinces—Medium
Redundant Connection—Medium
Redundant Connection IIread—Hard
Max Area of Island—Medium
Accounts Merge—Medium
Couples Holding Hands—Hard
Swim in Rising Water—Hard
Is Graph Bipartite?—Medium
Bricks Falling When Hit—Hard
Making A Large Island—Hard
Similar String Groupsread—Hard
Possible Bipartition—Medium
Minimize Malware Spreadread—Hard
Minimize Malware Spread II—Hard
Most Stones Removed with Same Row or Column—Medium
Largest Component Size by Common Factor—Hard
Regions Cut By Slashes—Medium
Satisfiability of Equality Equations—Medium
Number of Enclaves—Medium
Lexicographically Smallest Equivalent String—Medium
Smallest String With Swapsread—Medium
Number of Closed Islands—Medium
Count Servers that Communicate—Medium
Number of Operations to Make Network Connected—Medium
Validate Binary Tree Nodes—Medium
Check if There is a Valid Path in a Grid—Medium
Find Critical and Pseudo-Critical Edges in Minimum Spanning Treeread—Hard
Detect Cycles in 2D Gridread—Medium
Number of Ways to Reorder Array to Get Same BST—Hard
Remove Max Number of Edges to Keep Graph Fully Traversable—Hard
Min Cost to Connect All Points—Medium
Graph Connectivity With Threshold—Hard
Path With Minimum Effort—Medium
Rank Transform of a Matrixread—Hard
Checking Existence of Edge Length Limited Pathsread—Hard
Minimize Hamming Distance After Swap Operationsread—Medium
Count Sub Islands—Medium
Last Day Where You Can Still Crossread—Hard
Find if Path Exists in Graph—Easy
GCD Sort of an Array—Hard
Smallest Missing Genetic Value in Each Subtree—Hard
Process Restricted Friend Requestsread—Hard
Find All People With Secretread—Hard
Groups of Stringsread—Hard
Page 1 of 2