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.
Linked List PHP 5.3+ A linear data structure where elements (nodes) store a value and a pointer to the next node, enabling O(1) insertion and deletion at known positions.
2mo ago
data_structures beginner
LRU Cache A fixed-size cache that evicts the Least Recently Used entry when full, implemented with a hash map and doubly linked list for O(1) get and put.
2mo ago
data_structures advanced