Union-Find Interview Questions
74 real interview questions test Union-Find. Practice any of them in the code editor and get AI feedback on your solution.
- Junior1% (1)
- Mid/Senior53% (39)
- Staff46% (34)
Companies that ask Union-Find the most
Questions
- Number of Islands81 companiesMid/Senior
- Longest Consecutive Sequence40 companiesMid/Senior
- Evaluate Division23 companiesMid/Senior
- Max Area of Island19 companiesMid/Senior
- Accounts Merge18 companiesMid/Senior
- Making A Large Island16 companiesStaff
- Surrounded Regions12 companiesMid/Senior
- Is Graph Bipartite?10 companiesMid/Senior
- Possible Bipartition10 companiesMid/Senior
- Minimize Malware Spread10 companiesStaff
- Most Stones Removed with Same Row or Column10 companiesMid/Senior
- Number of Operations to Make Network Connected10 companiesMid/Senior
- Min Cost to Connect All Points10 companiesMid/Senior
- Number of Provinces9 companiesMid/Senior
- Path With Minimum Effort9 companiesMid/Senior
- Redundant Connection8 companiesMid/Senior
- Swim in Rising Water8 companiesStaff
- Smallest String With Swaps8 companiesMid/Senior
- Regions Cut By Slashes7 companiesMid/Senior
- Power Grid Maintenance7 companiesMid/Senior
- Satisfiability of Equality Equations6 companiesMid/Senior
- Count Servers that Communicate6 companiesMid/Senior
- Detect Cycles in 2D Grid6 companiesMid/Senior
- Divide Nodes Into the Maximum Number of Groups6 companiesStaff
- Maximum Number of Points From Grid Queries6 companiesStaff
- Minimum Cost Walk in Weighted Graph6 companiesStaff
- Couples Holding Hands5 companiesStaff
- Similar String Groups5 companiesStaff
- Lexicographically Smallest Equivalent String5 companiesMid/Senior
- Number of Closed Islands5 companiesMid/Senior
- Count Sub Islands5 companiesMid/Senior
- Find if Path Exists in Graph5 companiesJunior
- Minimum Score of a Path Between Two Cities5 companiesMid/Senior
- Make Lexicographically Smallest Array by Swapping Elements5 companiesMid/Senior
- Number of Enclaves4 companiesMid/Senior
- Remove Max Number of Edges to Keep Graph Fully Traversable4 companiesStaff
- Last Day Where You Can Still Cross4 companiesStaff
- Count Unreachable Pairs of Nodes in an Undirected Graph4 companiesMid/Senior
- Subarray With Elements Greater Than Varying Threshold4 companiesStaff
- Maximum Number of Fish in a Grid4 companiesMid/Senior
- Minimize Maximum Component Cost4 companiesMid/Senior
- Minimum Operations to Equalize Binary String4 companiesStaff
- Bricks Falling When Hit3 companiesStaff
- Validate Binary Tree Nodes3 companiesMid/Senior
- Check if There is a Valid Path in a Grid3 companiesMid/Senior
- Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree3 companiesStaff
- Rank Transform of a Matrix3 companiesStaff
- Minimize Hamming Distance After Swap Operations3 companiesMid/Senior
- Find All People With Secret3 companiesStaff
- Number of Good Paths3 companiesStaff
- Minimum Number of Visited Cells in a Grid3 companiesStaff
- Count the Number of Complete Components3 companiesMid/Senior
- Find the Safest Path in a Grid3 companiesMid/Senior
- Check if the Rectangle Corner Is Reachable3 companiesStaff
- Maximize Spanning Tree Stability with Upgrades3 companiesStaff
- Minimize Malware Spread II2 companiesStaff
- Largest Component Size by Common Factor2 companiesStaff
- Number of Ways to Reorder Array to Get Same BST2 companiesStaff
- Checking Existence of Edge Length Limited Paths2 companiesStaff
- Process Restricted Friend Requests2 companiesStaff
- Reachable Nodes With Restrictions2 companiesMid/Senior
- Maximum Segment Sum After Removals2 companiesStaff
- Minimum Time for K Connected Components2 companiesMid/Senior
- Count Islands With Total Value Divisible by K2 companiesMid/Senior
- Maximum Partition Factor2 companiesStaff
- Redundant Connection II1 companyStaff
- Graph Connectivity With Threshold1 companyStaff
- GCD Sort of an Array1 companyStaff
- Groups of Strings1 companyStaff
- Find the String with LCP1 companyStaff
- Minimum Reverse Operations1 companyStaff
- Properties Graph1 companyMid/Senior
- Path Existence Queries in a Graph I1 companyMid/Senior
- Maximize Alternating Sum Using Swaps1 companyStaff