Skip to content

problem2.md

Latest commit

 

History

History
14 lines (11 loc) · 760 Bytes

problem2.md

File metadata and controls

14 lines (11 loc) · 760 Bytes

Problem 2: Sorted Target Sum (Two Sum II - Input Array Is Sorted)

Problem Statement

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, added 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.

Input Format

  • A sorted array of integers numbers.
  • An integer target.

Example

Input: numbers = [2, 7, 11, 15], target = 9
Output: [1, 2]