If memory is not an issue but speed is critical how do you design a word registry

Question

Anonymous · Accepted Answer

Implement word registery #include #include #include class WordRegistry { private: struct TrieNode { std::array, 26> children{}; bool isWord = false; }; TrieNode root; public: // Supports lowercase English words: a-z void add(const std::string& word) { TrieNode* node = &root; for (char ch : word) { int index = ch - 'a'; if (!node->children[index]) { node->children[index] = std::make_unique(); } node = node->children[index].get(); } node->isWord = true; } bool contains(const std::string& word) const { const TrieNode* node = &root; for (char ch : word) { int index = ch - 'a'; if (!node->children[index]) { return false; } node = node->children[index].get(); } return node->isWord; } }; int main() { WordRegistry registry; registry.add("cat"); registry.add("car"); std::cout << registry.contains("cat") << ' '; // 1 std::cout << registry.contains("ca") << ' '; // 0 std::cout << registry.contains("can") << ' '; // 0 }

If memory is not an issue but speed is critical how do you design a word registry

Practice this question with AI

Go Premium

Community Answers

Unlock Full Access

Practice More Questions