Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit c61dfa1

Browse files
committed
update: README entries added
1 parent 3c3d2c4 commit c61dfa1

File tree

1 file changed

+3
-1
lines changed

1 file changed

+3
-1
lines changed

‎README.md‎

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -50,8 +50,10 @@ Collection of interview questions with Unit Tests. Problems includes Data Struct
5050
- [Find k Nodes from Root of BST](src/_DataStructures_/Trees/BinarySearchTree/find-k-nodes-from-root)
5151
- [Suffix Tree](src/_DataStructures_/SuffixTree)
5252
- [Trie](src/_DataStructures_/Trees/Trie)
53-
- [Total count of words in a Trie](src/_DataStructures_/Trees/Trie/total-words-in-trie)
53+
- [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)
5455
- [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)
5557

5658
### Logical Problems
5759

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /