Scribd
Upload
4 views1 page

Two Sum Problem Solution Guide

The document describes a problem called 'Two Sum' where the goal is to find indices of two numbers in an array that add up to a given target. It outlines a solution approach using a hash map to efficiently check for the required pairs while iterating through the array. The time complexity of the solution is O(n) and the space complexity is also O(n).

Uploaded by

yash
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views1 page

Two Sum Problem Solution Guide

The document describes a problem called 'Two Sum' where the goal is to find indices of two numbers in an array that add up to a given target. It outlines a solution approach using a hash map to efficiently check for the required pairs while iterating through the array. The time complexity of the solution is O(n) and the space complexity is also O(n).

Uploaded by

yash
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Two Sum

Description
Given an array of integers nums and an integer target, return indices of the two numbers such that they
add up to target. You may assume that each input would have exactly one solution, and you may not
use the same element twice.

Sample Test Case


Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].

Solution Approach
We can use a hash map to store the numbers and their indices while iterating through the list. For each
element, check if target - current number exists in the hash map. If it does, return the pair of indices.

Solution Code
class Solution:
def twoSum(self, nums, target):
hashmap = {}
for i, num in enumerate(nums):
if target - num in hashmap:
return [hashmap[target - num], i]
hashmap[num] = i

Time Complexity
Time Complexity: O(n), Space Complexity: O(n)

You might also like