# Two Sum Leetcode Solution Best & Easiest Two Sum Leetcode Solution Best & Easiest

In this post, we will solve the Two Sum HackerRank Solution. This problem (Two Sum) is a part of the HackerRank Problem Solving series.

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.

You can return the answer in any order.

Example 1:

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

Example 2:

```Input: nums = [3,2,4], target = 6
Output: [1,2]
```

Example 3:

```Input: nums = [3,3], target = 6
Output: [0,1]
```

Constraints:

• `2 <= nums.length <= 104`
• `-109 <= nums[i] <= 109`
• `-109 <= target <= 109`
• Only one valid answer exists.

Follow-up: Can you come up with an algorithm that is less than `O(n2) `time complexity?

## Two Sum Leet Code Solution

### Problem solution in JavaScript programming:

```var twoSum = function(nums, target) {
let output = []
for (let i=0;i<=nums.length;i++){
if(nums[i] + nums[i+1] == target){
output.push(i,i+1);
break;
}

}
return output
};
```