Approach: Two Pointers, Time complexity : O(n)1
2
3
4
5
6
7
8
9
10
11
12class Solution {
public int[] twoSum(int[] numbers, int target) {
int l=0,r=numbers.length-1;
while(l<r){
int sum=numbers[l]+numbers[r];
if(sum==target) return new int[]{l+1,r+1};
else if(sum<target) l++;
else r--;
}
return null;
}
}