-fix: problem name fix

Author: ashokdey

README.md

@@ -50,7 +50,7 @@ Collection of interview questions with Unit Tests. Problems includes Data Struct
     - [Find k Nodes from Root of BST](src/_DataStructures_/Trees/BinarySearchTree/find-k-nodes-from-root)
   - [Suffix Tree](src/_DataStructures_/SuffixTree)
   - [Trie](src/_DataStructures_/Trees/Trie)
-    - [Total Words in a Trie](src/_DataStructures_/Trees/Trie/total-words-in-trie)
+    - [Total count of words in a Trie](src/_DataStructures_/Trees/Trie/total-words-in-trie)
     - [All the words from a Trie](src/_DataStructures_/Trees/Trie/all-words-in-trie)
 
 ### Logical Problems