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 6469d5f

Browse files
committed
-fix: problem name fix
1 parent 4f7d0c7 commit 6469d5f

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -50,7 +50,7 @@ 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 Words in a Trie](src/_DataStructures_/Trees/Trie/total-words-in-trie)
53+
- [Total count of words in a Trie](src/_DataStructures_/Trees/Trie/total-words-in-trie)
5454
- [All the words from a Trie](src/_DataStructures_/Trees/Trie/all-words-in-trie)
5555

5656
### Logical Problems

0 commit comments

Comments
(0)

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