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.
Adjacency Matrix vs Adjacency List
Two ways to represent a graph — adjacency matrix (2D array, O(1) edge lookup, O(V²) space) vs adjacency list (array of lists, O(V+E) space, better for sparse graphs).
2mo ago
data_structures intermediate
Arrays PHP 5.0+
The most fundamental data structure — a contiguous block of memory holding elements of the same type, offering O(1) index access but O(n) insertion and deletion in the middle.
2mo ago
data_structures beginner