Union-Find, also known as Disjoint Set Union (DSU), is a data structure designed to efficiently handle connectivity queries and union operations betwean elements. Its primary use is to determine if two elements belong to the same connected component or set. Core Operations Union (Join): Merges the s...
Core Concepts Dynamic Array Allocation To create a dynamic array in C, use malloc from stdlib.h: int* arr = (int*)malloc(len * sizeof(int)); Reading Array Input with scanf scanf automatically skips whitespace (spaces, tabs, newlines) when reading input. Use getchar() to clear the newline character l...
Prefix Sums in One-Dimensional Arrays LeetCode Problem: Range Sum Query - Immutable Problem Overview Given an integer array nums, implement a data structure that can efficiently answer multiple queries for the sum of elements between indices left and right inculsive. Core Idea Instead of recalculati...
B-trees are height-balanced search trees dseigned to minimize I/O by packing many ordered keys into a single node sized to a disk block or cache line. Instead of assuming all data lives in main memory (as typical for AVL or Red-Black trees), B-trees optimize for large datasets by reducing the number...