We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Data-Structures-and-Algorithms/Java/soln-trie-problems/longest-common-prefix-case-sensitive.java
Lines 24 to 26 in 8ba5e1e
newNode.val=(char)('a'+index); // a+26 = { newNode.count=newNode.endsHere=0; for(int i=0;i<26;i++) // it should be 52 instead of 26
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Data-Structures-and-Algorithms/Java/soln-trie-problems/longest-common-prefix-case-sensitive.java
Lines 24 to 26 in 8ba5e1e
The text was updated successfully, but these errors were encountered: