Added solution for Two Sum Leetcode Problem#12
Open
Rifana-E wants to merge 10 commits intoWeCode-Community-Dev:mainfrom
Open
Added solution for Two Sum Leetcode Problem#12Rifana-E wants to merge 10 commits intoWeCode-Community-Dev:mainfrom
Rifana-E wants to merge 10 commits intoWeCode-Community-Dev:mainfrom
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
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.
We iterate through the array.
For each number, calculate the number needed to reach the target.
Check if this complement is already in the dictionary.
If the complement exists in the dictionary, that means we have found our pair.
We return the indices of the two numbers.
If the complement is not found, store the current number in the dictionary.
Continue checking for the rest of the numbers.