{"id":1074,"date":"2025-09-01T22:53:38","date_gmt":"2025-09-01T17:23:38","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=1074"},"modified":"2025-09-01T22:53:39","modified_gmt":"2025-09-01T17:23:39","slug":"implement-trie-ll","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/implement-trie-ll\/","title":{"rendered":"Implement Trie ll | Full Trie with Insert, Count, and Erase"},"content":{"rendered":"\n

The Implement Trie II<\/strong> problem is an extension of the basic Implement Trie (Prefix Tree)<\/strong>. In addition to inserting words and checking prefixes, this version requires advanced operations like:<\/p>\n\n\n\n

    \n
  1. Insert(word):<\/strong> Insert a word into the Trie.<\/li>\n\n\n\n
  2. countWordsEqualTo(word):<\/strong> Return the number of times a given word has been inserted.<\/li>\n\n\n\n
  3. countWordsStartingWith(prefix):<\/strong> Return the number of words that start with the given prefix.<\/li>\n\n\n\n
  4. erase(word):<\/strong> Remove one occurrence of the word from the Trie.<\/li>\n<\/ol>\n\n\n\n

    This extended Trie allows handling multiple occurrences of the same word and gives more control over word counts.<\/p>\n\n\n\n

    Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n

    \n\n\n\n

    Example<\/h3>\n\n\n\n
    <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
    Operations<\/span>: <\/span><\/span>\ninsert("apple")<\/span><\/span>\ninsert("apple")<\/span><\/span>\ncountWordsEqualTo("apple")   \u2192 2<\/span><\/span>\ncountWordsStartingWith("app") \u2192 2<\/span><\/span>\nerase("apple")<\/span><\/span>\ncountWordsEqualTo("apple")   \u2192 1<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
    Explanation:<\/p>\n\n\n\n