---
title: "Aritra Pal (@aritrapal) | Hashnode"
description: "Hi, myself Aritra Pal. I am currently pursuing BTech in Computer Science and Technology from Indian Institute of Engineering Science and Technology, Shibpur...."
url: "https://hashnode.com/@aritrapal"
---

@aritrapal

# Aritra Pal

@aritrapal · West Bengal, India · Joined October 2024

### [Disjoint Set Union Algorithm (Union Find Algorithm)](https://aritrapal.hashnode.dev/disjoint-set-union-algorithm-union-find-algorithm?utm_source=hashnode&utm_medium=feed)

Introduction In computer science, the choice of data structure plays a crucial role in determining how efficiently a problem's query is handled. Selecting the right data structure can drastically reduce execution time, which is essential when solving...

15 min read · [aritrapal.hashnode.dev](https://aritrapal.hashnode.dev/disjoint-set-union-algorithm-union-find-algorithm?utm_source=hashnode&utm_medium=feed)

[Aug 17, 2024](https://hashnode.com/posts/disjoint-set-union-algorithm-union-find-algorithm/670e130b12ab6a977f89e1db)

### [Decoding Graph Algorithm Complexities](https://aritrapal.hashnode.dev/decoding-graph-algorithm-complexities?utm_source=hashnode&utm_medium=feed)

When discussing the time complexities of key graph algorithms, it’s important to start with the basics. Let’s consider a graph G with V vertices and E edges. The algorithms we’ll explore can apply to both directed and undirected graphs, depending on ...

8 min read · [aritrapal.hashnode.dev](https://aritrapal.hashnode.dev/decoding-graph-algorithm-complexities?utm_source=hashnode&utm_medium=feed)

[Jun 26, 2024](https://hashnode.com/posts/decoding-graph-algorithm-complexities/670dada54008cd293490a2d1)
