Union Find

1 problem using this pattern

About this pattern:

A useful algorithmic pattern for solving coding problems efficiently.

Often used with: DFS Graph

Complexity Range

Time Complexity

O(V + E) (1 problem)

Space Complexity

O(V) (1 problem)

Problems Using Union Find

Number of Connected Components

Count connected components using DFS traversal.

Medium LeetCode
Time: O(V + E)
Space: O(V)
Example: n=5, edges=[[0,1],[1,2],[3,4]] → 2
Graph DFS Union Find
View Solution →
← Back to All Patterns
View All Categories