Union by Rank + Path Compression

Category: Advanced

Difficulty: advanced

Description: Optimized union-find

Time Complexity: O(α(n))

Space Complexity: O(n)

Related LeetCode Problems

• 997. Find the Town Judge (Easy)
• 547. Number of Provinces (Medium)
• 323. Number of Connected Components in an Undirected Graph (Medium)
• 684. Redundant Connection (Medium)
• 721. Accounts Merge (Medium)
• 990. Satisfiability of Equality Equations (Medium)
• 305. Number of Islands II (Hard)
• 1584. Min Cost to Connect All Points (Medium)
• 1135. Connecting Cities With Minimum Cost (Medium)
• 815. Bus Routes (Hard)