Practice problems across 75+ categories
Practice problems frequently asked at Union Find • 89 problems | 1 Easy | 43 Medium | 43 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 1 | Archipelago Explorer | Easy | GraphBFSDFS |
| 2 | Bricks Falling When Hit | Hard | ArrayUnion FindMatrix |
| 3 | Check for Contradictions in Equations | Hard | ArrayDepth-First SearchUnion Find |
| 4 | Check if the Rectangle Corner Is Reachable | Hard | ArrayMathDepth-First Search |
| 5 | Check if There is a Valid Path in a Grid | Medium | ArrayDepth-First SearchBreadth-First Search |
| 6 | Checking Existence of Edge Length Limited Paths | Hard | ArrayTwo PointersUnion Find |
| 7 | Checking Existence of Edge Length Limited Paths II | Hard | Union FindGraphMinimum Spanning Tree |
| 8 | Classroom Seating Conflict | Easy | GraphBFSBipartite |
| 9 | Connecting Cities With Minimum Cost | Medium | Union FindGraphHeap (Priority Queue) |
| 10 | Count Connected Components in LCM Graph | Hard | ArrayHash TableMath |
| 11 | Count Servers that Communicate | Medium | ArrayDepth-First SearchBreadth-First Search |
| 12 | Count Sub Islands | Medium | ArrayDepth-First SearchBreadth-First Search |
| 13 | Count the Number of Complete Components | Medium | Depth-First SearchBreadth-First SearchUnion Find |
| 14 | Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | Depth-First SearchBreadth-First SearchUnion Find |
| 15 | Couples Holding Hands | Hard | GreedyDepth-First SearchBreadth-First Search |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
