https://vhaos-leetcode-solutions.now.sh/tags/trie/ Recent content in Trie on Vhaos's Leetcode Solutions Hugo -- gohugo.io en-us Kareem Daggash Sun, 23 Aug 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/23-stream-of-characters/ Sun, 23 Aug 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/23-stream-of-characters/ LeetCode August - Day 23 Problem Statement Implement the StreamChecker class as follows: StreamChecker(words): Constructor, init the data structure with the given words. query(letter): returns true if and only if for some k >= 1, the last k characters queried (in order from oldest to newest, including this letter just queried) spell one of the words in the given list. Example: StreamChecker streamChecker = new StreamChecker(["cd","f","kl"]); // init the dictionary.