Disjoint Set Union By Rank and Path Compression
DSU · 22:09DSU · Graph Concepts & Qns -19 · Explanation+CodeMy notes
Sign in to keep private notes on every station, with video timestamps.
About this video
Video lecture "Disjoint Set Union By Rank and Path Compression" by codestorywithMIK, part of the Graphs chapter of the Data Structures & Algorithms course (22:09).
- Patterns
- DSU
- Chapter
- Graphs
- Duration
- 22:09
Related problems
- Detect Cycle using DSU - (Google, Microsoft)
- Count Unreachable Pairs of Nodes in an Undirected Graph (LeetCode 2316)
- Number of Good Paths (LeetCode 2421)
- Similar String Groups (LeetCode 839)
- Checking Existence of Edge Length Limited Paths (LeetCode 1697)
- Remove Max Number Of Edges To Keep Graph Fully Traversable (LeetCode 1579)
- Validate Binary Tree Nodes (LeetCode 1361)
- Minimum Cost Walk in Weighted Graph (LeetCode 3108)