- Data Structures Overview
Survey of linear, non-linear, hash-based, and advanced data structures with their operations, time complexities, use cases, and selection guidance.
- Persistent Segment Tree
Explains how a persistent segment tree keeps every historical version of the data using path copying, and where it is applied.
- Segment Tree
Explains the segment tree for O(log n) range queries and updates, with example problems (LIS, range minimum) and lazy propagation.
- Bloom Filter
Overview of the Bloom filter probabilistic data structure, its false-positive behavior, and common applications.
- Algo Heap Trie Graphs
TypeScript notes on heaps and priority queues, tries, graph representations and traversals, maps, and LRU cache design.