---
title: "#disjoint-set articles | Hashnode"
description: "Explore 7 articles tagged #disjoint-set on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/disjoint-set"
---

Tag

# #disjoint-set

7 posts · 0 followers

[Chetan Datta](https://hashnode.com/@chetan77) · [Oct 18, 2025](https://hashnode.com/posts/accounts-merge/68f378cd29e98f864eac23dc)

### [Accounts Merge](https://chetan77.hashnode.dev/accounts-merge?utm_source=hashnode&utm_medium=feed)

Problem Given a list of accounts where each element accounts\[i\] is a list of strings, where the first element accounts\[i\]\[0\] is a name, and the rest of the elements are emails representing emails of t

4 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/accounts-merge?utm_source=hashnode&utm_medium=feed)

[Chetan Datta](https://hashnode.com/@chetan77) · [Oct 12, 2025](https://hashnode.com/posts/disjoint-set/68eba488a9fe332bb096c1a5)

### [Disjoint Set - Data Structure](https://chetan77.hashnode.dev/disjoint-set?utm_source=hashnode&utm_medium=feed)

Introduction A disjoint set is a data structure that helps determine if two nodes are part of the same component efficiently. While BFS or DFS can be used to check this, a disjoint set can perform the task in constant time. It is particularly useful ...

2 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/disjoint-set?utm_source=hashnode&utm_medium=feed)

[Chetan Datta](https://hashnode.com/@chetan77) · [Oct 12, 2025](https://hashnode.com/posts/kruskals-algorithm-mst/68eba505cb96bd7b6b446a4f)

### [Kruskal's Algorithm - MST](https://chetan77.hashnode.dev/kruskals-algorithm-mst?utm_source=hashnode&utm_medium=feed)

Problem Given a weighted, undirected, and connected graph with V vertices and E edges, the task is to find the sum of the weights of the edges in the Minimum Spanning Tree (MST) of the graph using Kruskal's Algorithm. The graph is represented as an e...

3 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/kruskals-algorithm-mst?utm_source=hashnode&utm_medium=feed)

[Abhi](https://hashnode.com/@abhikommen) · [Apr 12, 2025](https://hashnode.com/posts/number-of-islands-ii/67faea8e88967e8771f02fac)

### [Number of Islands II](https://dynamicprogramming.hashnode.dev/number-of-islands-ii?utm_source=hashnode&utm_medium=feed)

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...

5 min read · [dynamicprogramming.hashnode.dev](https://dynamicprogramming.hashnode.dev/number-of-islands-ii?utm_source=hashnode&utm_medium=feed)

[Jyothishree Rajkumar](https://hashnode.com/@JyothishreeRajkumar) · [Nov 10, 2024](https://hashnode.com/posts/union-find-algorithmgraph-theory-beginner-friendly-explanation/673078e4188269111b2ca703)

### [Union Find Algorithm(Graph Theory)- Beginner friendly explanation](https://jyothishree.hashnode.dev/union-find-algorithmgraph-theory-beginner-friendly-explanation?utm_source=hashnode&utm_medium=feed)

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...

3 min read · [jyothishree.hashnode.dev](https://jyothishree.hashnode.dev/union-find-algorithmgraph-theory-beginner-friendly-explanation?utm_source=hashnode&utm_medium=feed)

[1](https://hashnode.com/posts/union-find-algorithmgraph-theory-beginner-friendly-explanation/673078e4188269111b2ca703)

[Stephen Ivuelekwa](https://hashnode.com/@streetCoderr) · [Oct 15, 2023](https://hashnode.com/posts/a-simplified-view-of-disjoint-set/656d97297205134fa30e05f6)

### [A Simplified view of Disjoint Set](https://streetcoderr.hashnode.dev/a-simplified-view-of-disjoint-set?utm_source=hashnode&utm_medium=feed)

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...

10 min read · [streetcoderr.hashnode.dev](https://streetcoderr.hashnode.dev/a-simplified-view-of-disjoint-set?utm_source=hashnode&utm_medium=feed)

[1](https://hashnode.com/posts/a-simplified-view-of-disjoint-set/656d97297205134fa30e05f6)

[Miradil Zeynalli](https://hashnode.com/@mmzeynalli) · [Oct 11, 2023](https://hashnode.com/posts/solving-dsa-eolymp-325/65c36e76eb300ba75fcbab05)

### [Solving DSA Problems. Eolymp 325: Dangerous route](https://mmzeynalli.hashnode.dev/solving-dsa-eolymp-325?utm_source=hashnode&utm_medium=feed)

Problem statement In one country there are n cities, some of which are connected by two-way routes. Cities are numbered by integers from 1 to n. In times of financial crisis the level of the crime in a state rose and the crime groups are organized. T...

5 min read · [mmzeynalli.hashnode.dev](https://mmzeynalli.hashnode.dev/solving-dsa-eolymp-325?utm_source=hashnode&utm_medium=feed)
