Trie – LeetCode Solution [Medium]

A Trie (pronounced as “try”) or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. Applications There are various applications of this special data structure such as : Autocomplete in mobile and web applications Spelling checker Solving word games and many more. Implementation Trie is […]