In the **Leetcode Two Sum problem solution in Java programming** 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.

## Leetcode Two Sum problem solution in Java programming

```
class Solution {
public int[] twoSum(int[] nums, int target) {
for (int i = 0; i < nums.length; ++i) {
for (int j = i + 1; j < nums.length; ++j) {
if (nums[i] + nums[j] == target) {
return new int[]{i, j};
}
}
}
return null;
}
}
```

**Also read,**

- Leetcode Two Sum Problem Solution in C
- Leetcode Two Sum Problem Solution in C++
- Leetcode Two Sum Problem Solution in Python
- Leetcode two Sum Problem Solution in C#