Tries

A [trie](https://en.wikipedia.org/wiki/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. Implement the Trie class: * Trie() Initializes the trie object. * void insert(String word) Inserts the string word into the trie. * boolean search(String word) Returns true if the string word is in the trie...

You are given a stream of n videos, each represented by a distinct number from 1 to n that you need to "upload " to a server. You need to implement a data structure that calculates the length of the longest uploaded prefix at various points in the upload process. We consider i to be an uploaded prefix if all videos in the range 1 to i (inclusive) have been uploaded to the server. The longest uploaded prefix is the maximum value of i that satisfies this definition...

Design a data structure that supports adding new words and finding if a string matches any previously added string. Implement the WordDictionary class: * WordDictionary() Initializes the object. * void addWord(word) Adds word to the data structure, it can be matched later. * bool search(word) Returns true if there is any string in the data structure that matches word or false otherwise. word may contain dots '.' where dots can be matched with any letter. Example: **Inp...

Given an m x n board of characters and a list of strings words, return _all words on the board_. Each word must be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word. Example 1: Input: board = \[\[ "o ", "a ", "a ", "n "\],\[ "e ", "t ", "a ", "e "\],\[ "i ", "h ", "k ", "r "\],\[ "i ", "f ", "l ", "v "\]\], words = \[ "oath ", "pea ", "eat ", ...