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.
Hash Table PHP 5.0+ A data structure that maps keys to values using a hash function, providing amortised O(1) average-case lookups, insertions, and deletions.
2mo ago
data_structures intermediate
Heaps & Priority Queues PHP 5.3+ A tree-based structure satisfying the heap property — min-heap: parent ≤ children; max-heap: parent ≥ children — enabling O(1) peek and O(log n) insert/extract for priority queues.
2mo ago
data_structures intermediate