Alphanumeric String Sort; Array Pair Sum; Array Sum - Java solution #121
Conversation
This file contains 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
TheMly
changed the title
|
@TheMly we have a simpler solution for the alnum sorting problem in Java by now. Would you mind updating your PR? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
A Java solution for the Alphanumeric String Sort problem.
Also a Java solution for the Array Pair Sum problem, since the Java solution that is in the project for this problem, doesn't actually do what is supposed to do. For example, instead of outputting the pair [4,4] three times for that test case, that solution only outputs it two times.
My solution performs as is specified in the readme of the problem, as you can verify with the unit tests that I'm including in my commit too :)
EDIT 1: Added a Java solution for the Array Sum problem too ;)