We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 3c3d2c4 commit c61dfa1Copy full SHA for c61dfa1
README.md
@@ -50,8 +50,10 @@ Collection of interview questions with Unit Tests. Problems includes Data Struct
50
- [Find k Nodes from Root of BST](src/_DataStructures_/Trees/BinarySearchTree/find-k-nodes-from-root)
51
- [Suffix Tree](src/_DataStructures_/SuffixTree)
52
- [Trie](src/_DataStructures_/Trees/Trie)
53
- - [Total count of words in a Trie](src/_DataStructures_/Trees/Trie/total-words-in-trie)
+ - [Total words count count in a Trie](src/_DataStructures_/Trees/Trie/total-words-in-trie)
54
+ - [Unique words count in a Trie](src/_DataStructures_/Trees/Trie/unique-word-count)
55
- [All the words from a Trie](src/_DataStructures_/Trees/Trie/all-words-in-trie)
56
+ - [Unique words in a Trie](src/_DataStructures_/Trees/Trie/get-unique-words)
57
58
### Logical Problems
59
0 commit comments