Union-Find

Hard | Array, Hash Table, Tree, Union-Find, Graph Theory, Sorting

Medium | Hash Table, Binary Search, Union-Find, Design, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Ordered Set

Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory

Hard | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory

Hard | Array, Two Pointers, Breadth-First Search, Union-Find, Sorting, Heap (Priority Queue), Matrix

Hard | Array, String, Dynamic Programming, Greedy, Union-Find, Matrix

Hard | Array, Hash Table, Breadth-First Search, Union-Find, Ordered Set

Hard | Array, Dynamic Programming, Stack, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix, Monotonic Stack

Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory

Medium | Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Binary Tree

Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix

Hard | Array, Math, Divide and Conquer, Dynamic Programming, Tree, Union-Find, Binary Search Tree, Memoization, Combinatorics, Binary Tree

Medium | Array, Union-Find, Graph Theory, Minimum Spanning Tree

Hard | Array, Math, Union-Find, Number Theory

Hard | Array, Union-Find, Graph Theory, Topological Sort, Sorting, Matrix

Hard | Array, Two Pointers, Union-Find, Graph Theory, Sorting

Medium | Array, Depth-First Search, Union-Find

Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix

Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Matrix

Easy | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory