fix go solution for "group-anagrams" to be optimal #2470
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
Such a solution corresponds to the algorithm provided by the author and is more optimal. |
implement using letter count array as a key instead of a sorted string, according to the video solution.
hiendevt
force-pushed
the
group_anagrams_go_fix
branch
from
245a709 to
f282f89
Compare
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
fix go solution for "group-anagrams" to be optimal
implement using letter count array as a key instead of a sorted string, according to the video solution.
Important
Please make sure the file name is lowercase and a duplicate file does not already exist before merging.