Data_structures terms
The right container makes every algorithm faster
Choosing the right data structure is often the difference between an algorithm that runs in milliseconds and one that times out. This category covers arrays, linked lists, trees, graphs, heaps, hash tables, and more complex structures — with focus on when to use each, what operations are fast or slow, and how they underpin the algorithms built on top of them.
Segment Trees
A tree data structure for O(log n) range queries and point updates — supporting sum, min, max over arbitrary array ranges.
2mo ago
data_structures advanced
Skip Lists
A probabilistic data structure providing O(log n) search, insert, and delete — used internally in Redis sorted sets for ZADD/ZRANGE operations.
2mo ago
data_structures advanced
Sparse Matrix Representations
COO, CSR, and DOK formats efficiently store matrices where most values are zero — avoiding storing terabytes of zeros for recommendation systems and graphs.
2mo ago
data_structures advanced
Stacks PHP 5.3+ A LIFO (Last In, First Out) data structure — the last element pushed is the first popped. Used for function call stacks, undo history, expression parsing, and DFS traversal.
2mo ago
data_structures beginner