-
-
Notifications
You must be signed in to change notification settings - Fork 47.2k
Two-Sum to match target #12883
New issue
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
base: master
Are you sure you want to change the base?
Two-Sum to match target #12883
Conversation
for more information, see https://pre-commit.ci
Hi! Kindly requesting a review for this PR when convenient. Thanks |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper
commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper review
to trigger the checks for only added pull request files@algorithms-keeper review-all
to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
@@ -0,0 +1,24 @@ | |||
def two_sum(nums: list[int], target: int) -> tuple[int, int] | None: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
As there is no test file in this pull request nor any test function or class in the file interview-bootcamp/Two-Sum.py
, please provide doctest for the function two_sum
for more information, see https://pre-commit.ci
This PR adds the solution to the classic "Two Sum" problem using a hash map for optimized lookup. The code includes:
Problem statement as a comment
Optimized solution using a dictionary (O(n) time)
A test case under the main block
Proper docstrings for clarity
Problem Summary
Given an array nums and an integer target, return the indices of the two numbers such that they add up to target.