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.
Trie (Prefix Tree)
A tree where each node represents a character — paths from root to leaf spell out keys, enabling O(m) lookup, prefix search, and autocomplete where m is key length, independent of dataset size.
1mo ago
data_structures intermediate
Tries (Prefix Trees) PHP 5.0+
A tree where each path from root to node spells a prefix — enabling O(m) insert, lookup, and prefix search where m is the string length, regardless of dictionary size.
2mo ago
data_structures advanced