# 1. Two Sum

## 26 Mar 1. Two Sum

1. Two Sum

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].```

class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:for i in range(len(nums)):
for j in range(i+1,len(nums) ):
tmp = nums[i] + nums[j]
if(tmp == target):
returnList =[]
returnList.append(i)
returnList.append(j)
return returnList

C#

public class Solution {

public int[] TwoSum(int[] nums, int target) {

int[] returnvalue=new int[2];

for (int i=0;i<nums.Length ;i++)

{

for(int j=i+1;j<nums.Length ;j++)

{

if(nums[i]+nums[j]==target)

{

returnvalue[0]=i;

returnvalue[1]=j;

}

}

}

return returnvalue;

}

}

Python 3

class Solution:

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

for i in range(len(nums)):

for j in range(i+1, len(nums)):

if nums[i]+nums[j] == target:

return [i,j]

return []

Java

class Solution {

public int[] twoSum(int[] nums, int target) {

int[] returnvalue=new int[2];

for(int i=0; i<nums.length;i++){

for(int j=i+1; j<nums.length; j++){

if(nums[i]+nums[j]==target){

returnvalue[0]=i;

returnvalue[1]=j;

return returnvalue;

}

}

}

return returnvalue;

}

}