AI Interview Prep is optimized for larger screens

Please open this on a laptop or desktop (1024px and wider) to use the full editor, whiteboard, and AI coaching surface.

JarviixAll problems

Two Sum II — Input Array Is Sorted

Medium

Two Pointers · Binary Search · Array~15m

Live AI Interview

00:00

Section 1Understand Problem

Section 01

Understand the problem

Restate the problem precisely. Interviewers reward candidates who pause, define the contract, and name the guarantees before coding.

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.

Example

numbers = [2, 7, 11, 15], target = 9 → [1, 2]

Constraints

2 ≤ numbers.length ≤ 3 × 10⁴ · −1000 ≤ numbers[i] ≤ 1000 · Test cases are guaranteed to have one solution

Audio recording unsupported on this browser.

WPM—Fillers0Pace—Thinking0%

Explain the problem in your own words

0 words0 chars

AI Review

Write your thinking above first.

Once you've drafted a response, click Submit for AI review and a senior engineer will critique your reasoning.

Ready to submit Section 1?

The reviewer will check whether you stated inputs, output, guarantees, and any assumption you flagged.

Write at least a couple of sentences explaining the problem before submitting.