Given a 1-indexed sorted array and a target, find two numbers that add up to the target. Return their indices. Example: numbers = [2, 7, 11, 15], target = 9. Output: [1, 2] because numbers[1] + numbers[2] = 2 + 7 = 9. The array is already sorted. You'll use this property to avoid the hash map approach from Two Sum.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/two-pointers-sliding-window/problem-two-sum-ii
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████████████████████████████████████████████████████████████████████████████████████████████