Two Sum II - Input Array Is Sorted
Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length.
Return the indices of the two numbers index1 and index2, each incremented by one, as an integer array [index1, index2] of length 2.
The tests are generated such that there is exactly one solution. You may not use the same element twice.
Your solution must use only constant extra space.
Example 1
Input
numbers = [2,7,11,15], target = 9Output
[1,2]The numbers at 1-indexed positions 1 and 2 are 2 and 7, which sum to 9.
Example 2
Input
numbers = [2,3,4], target = 6Output
[1,3]The numbers at 1-indexed positions 1 and 3 are 2 and 4, which sum to 6.
Constraints
- 2 <= numbers.length <= 3 * 10^4
- -1000 <= numbers[i] <= 1000
- numbers is sorted in non-decreasing order
- -1000 <= target <= 1000
- The tests are generated such that there is exactly one solution
Asked at 17 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.