📄️ Disjoint Set Union
Disjoint Set Union (Union-Find) is an efficient data structure to track the union of disjoint sets.
📄️ Segment Trees
Segment Trees are used for efficient range queries.
📄️ Fenwick Tree
Fenwick Tree (Binary Indexed Tree) is a more space-efficient data structure for cumulative frequency tables.