Jul 15, 2025 · 3 min read · Union-Find, also known as Disjoint Set Union (DSU), is a data structure that efficiently keeps track of a set of elements partitioned into disjoint (non-overlapping) subsets. It's particularly useful in problems involving connectivity, such as determ...
Join discussion
May 23, 2025 · 5 min read · 🔍 Introduction Have you ever had to answer the question: “Are these two elements in the same group?” That’s exactly the kind of problem Union Find (also known as Disjoint Set Union or DSU) is built to solve. This data structure shines in scenarios l...
Join discussion
Apr 12, 2025 · 5 min read · A 2d grid map of m rows and n columns is initially filled with water. We may perform an addLand operation which turns the water at position (row, col) into a land. Given a list of positions to operate, count the number of islands after each addLand o...
Join discussion
Dec 26, 2024 · 9 min read · Welcome to Day 30 of my 100 Days of DSA challenge! Today, I delved into advanced graph techniques and the Union-Find algorithm, a powerful tool for managing disjoint sets and solving connectivity problems. From detecting cycles in graphs to merging a...
Join discussion
Nov 10, 2024 · 3 min read · If you are learning about graphs, then there is one thing that u must keep in your mind, that everything will not be understandable in a single go. Visualization helps a lot. But these concepts are essential in DSA point of view, if you are trying to...
KKarthikeyan commentedOct 15, 2023 · 10 min read · Introduction The disjoint set data structure is a form of data representation majorly used to solve problems that have to do with connectivity. It maintains a collection of disjoint subsets. It has many applications in real life such as social networ...
HPeter commented