Disjoint Set Data Structures | Union Find | DSU | Range Query
We learn about a super useful and interesting data structure called the Disjoint set data structure.
Contents:
A sample problem on graphs
Some solutions to the problem
What is a disjoint set data structure?
Linked-List implementation of the Structure.
Time-Complexity of the operations
Revisit the problem
Weighted union heuristic and Again Revisit the problem
Tree/Forest like implementation
Path Compression and Union by Rank heuristics
Time complexity and revisit the problem
A blog I wrote long back on some good range query problems: https://codeforces.com/blog/entry/77128
If you'd like to learn more please leave a comment and like the video!