New Contest Live Now

Master the Art of Algorithms

The world's leading platform for learning tech skills. Sharpen your coding with over 2,500 challenges. Join a community of over 5 million developers.

2.5k+

Questions

5M+

Users

Daily

Challenges

solution.py

# Time Complexity: O(n)

class Solution:

def twoSum(self, nums: List[int], target: int) -> List[int]:

prevMap = {} # val : index

for i, n in enumerate(nums):

diff = target - n

if diff in prevMap:

return [prevMap[diff], i]

prevMap[n] = i

return []

check_circleAccepted

data_object

Practice classic problems

storage

SQL and design

terminal

Bash scripting challenges

emoji_events

Compete weekly

Trending Problems

Most solved problems this week

Status	Title	Acceptance	Difficulty
check_circle_outline	1. Two Sum	48.2%	Easy
radio_button_unchecked	2. Add Two Numbers	39.1%	Medium
radio_button_unchecked	42. Trapping Rain Water	56.8%	Hard
check_circle_outline	217. Contains Duplicate	62.1%	Easy
radio_button_unchecked	53. Maximum Subarray	50.0%	Medium

Join Premium to access exclusive content, company-specific questions, and detailed video solutions.