Skip to content
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.

Sign up for GitHub

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

Jump to bottom

Added solution for 1. Two Sum Leetcode problem #303

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Added solution for 1. Two Sum Leetcode problem #303

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
83bae76
Added two sum solution with the problem description
Am4teur Oct 23, 2021
df09594
Corrected CodeFactor issues
Am4teur Oct 23, 2021
790362d
Deleted problem description from solution
Am4teur Oct 27, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 12 additions & 0 deletions LeetCode/Problems/Python/2_Two_Sum.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
class Solution:
def twoSum(self, nums, target):
targets_dict = {}

for i, num in enumerate(nums):
if(num in targets_dict):
return [targets_dict[num], i]
targets_dict[target-num] = i

# we do not need to return because we assume that
# we have exactly one solution
# return -1