Trie problems

[ashokdey]

🔍 What's inside?

This PR contains a few problems involving Trie DataStructure.

• Total count of words in a Trie
• All the words in a Trie

[TheSTL]

@ashokdey Test cases where all-words-in-trie and total-words-in-trie failed:

• In all-words-in-trie`
  • words = ['bed', 'ball', 'ball'];
  • output: 2
  • expected output: 3
• total-words-in-trie
  • words = ['bed', 'ball', 'ball']
  • output : ['bed', 'ball']
  • expected output : ['bed', 'ball', 'ball']

[ashokdey]

@ashokdey Test cases where all-words-in-trie and total-words-in-trie failed:

• In all-words-in-trie`

  • words = ['bed', 'ball', 'ball'];
  • output: 2
  • expected output: 3

• total-words-in-trie

  • words = ['bed', 'ball', 'ball']
  • output : ['bed', 'ball']
  • expected output : ['bed', 'ball', 'ball']

Do Tries store the same word twice? The path is same hence I don't see a chance it will store the same word more than once.

[TheSTL]

@ashokdey Suppose I inserted 'ball' 2 times in trie. Path will be same .
Now I asked you tell me the count of unique string then answer should be 1 and tell me count of total string , it should be 2.
Problem is count total words therefore word repetition can be found in input.

[ashokdey]

Thanks, done! 💯

[TheSTL]

@ashokdey 💯