Advanced Data Structures
Master advanced data structures by solving these carefully selected problems
Problems
208. Implement Trie (Prefix Tree)
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. There are various applications of this data structure, such as autocomplete and spellchecker.
Medium
307. Range Sum Query - Mutable
Given an integer array `nums`, handle multiple queries of the following types:
Medium
211. Design Add and Search Words Data Structure
Design a data structure that supports adding new words and finding if a string matches any previously added string.
Medium
212. Word Search II
Given an `m x n` `board` of characters and a list of strings `words`, return all words on the board.
Hard
315. Count of Smaller Numbers After Self
Given an integer array `nums`, return an integer array `counts` where `counts[i]` is the number of smaller elements to the right of `nums[i]`.
Hard