Added: LeetCode solution for Two Sum #523
Open
+6 −0
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
| I can tell this is your first pull request! Thank you I'm so honored. 🎉🎉🎉 I'll take a look at it ASAP! |
| Good sasi kanth |
| Hello! 👋 This is my first Hacktoberfest contribution, adding a solution for the Two Sum problem with a clear explanation and README update. I would greatly appreciate it if you could take a moment to review this pull request. Please let me know if any improvements or changes are needed. Thank you very much for your time and for maintaining such a valuable repository! Best regards, |
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
2 participants
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.
Two Sum
Problem:
Given an array of integers
numsand an integertarget, return indices of the two numbers such that they add up to target.Approach:
Use a hash map (dictionary) to store visited numbers and their indices. For each element, check if the complement (target - current number) exists in the map. If yes, return the indices.
Time Complexity: O(n)
Space Complexity: O(n)
Difficulty Level: Easy
Tags: Array, Hash Map
Contributor: sasi-upparapalli