two_sum

README

< Previous 　　　　　　　　　　　　　　　　 Next >

1. Two Sum (Easy)

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

 

Related Topics

[Array] [Hash Table]

Similar Questions

1. 3Sum (Medium)
2. 4Sum (Medium)
3. Two Sum II - Input array is sorted (Easy)
4. Two Sum III - Data structure design (Easy)
5. Subarray Sum Equals K (Medium)
6. Two Sum IV - Input is a BST (Easy)