Data Structures
Study Material for Data Structures
Ch 8: Vectors, Pairs & Utility Algorithms
std::vector — The Dynamic Array · std::pair — Grouping Two Values · std::tuple — Grouping Three or More Values (D1) · String STL Methods (Advanced) · Iterators — The Bridge Between Containers and Algorithms · Utility Algorithms
Ch 9: Sets, Maps & Multi-Containers
std::set — Ordered Unique Elements · std::multiset — Ordered Elements with Duplicates · std::map — Key-Value Associations · std::unordered_map & std::unordered_set — Hash-Based Containers · std::stack — LIFO Container Adapter · std::queue — FIFO Container Adapter · std::deque — Double-Ended Queue · std::priority_queue — Heap-Based Container
Ch 20: Coordinate Compression, Fenwick Tree & Segment Tree
Coordinate Compression · Fenwick Tree (Binary Indexed Tree) · Segment Tree · Sparse Table (D1 — Recognition)
Ch 19: Disjoint Set Union (DSU)
The Problem DSU Solves · Naive Implementation · Optimization 1: Path Compression · Optimization 2: Union by Rank/Size · Component Queries
Ch 18: Stacks, Queues & Monotonicity
Stack Applications · Queue Applications · Monotonic Stack · Monotonic Deque (Sliding Window Min/Max)
Related Topics
Published by RunTimeFix · Comprehensive guides for competitive programming