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 \leq ext{index1} < ext{index2} \leq$ numbers.length.

Return the indices of the two numbers, index1 and index2, as an integer array [index1, index2] of length $2$.

Note: The tests are generated such that there is exactly one solution, and the same element cannot be used twice.

Constraints:

• $2 \leq$ numbers.length $\leq 3 imes 10^4$

• $-1000 \leq$ numbers[i] $\leq 1000$

• numbers is sorted in non decreasing order.

• $-1000 \leq$ target $\leq 1000$

• The tests are generated such that there is exactly one solution.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.