*can someone please give a efficient solution and explain please, I am little rusty with hash tables*

```
public class Solution {
public int[] twoSum(int[] numbers, int target) {
int len = numbers.length;
int x = 0;
int y = 0;
while(x<len){
y = x+1;
while(y<len){
if((numbers[x] + numbers[y])== target){
int [] val = {x+1,y+1};
return val;
}
y++;
}
x++;
}
return null;
}
}
```