# Two Sum II - Input Array Is Sorted (LeetCode 167): Interview Notes
## Problem
Given a 1-indexed sorted array of integers `numbers` and a target, return the indices of the two numbers that add up to target. Exactly one solution; cannot reuse the same element.
## Approach
Two pointers at ends. If sum too large, move right left; too small, move left right. Because sorted, the pointers converge correctly. Contrast with the hash-map LC 1 solution.
## Complexity
Time O(n), space O(1).
## Practice tip
Compare pointer vs hash tradeoffs using [https://www.linkjob.ai/coding-interview-copilot/](https://www.linkjob.ai/coding-interview-copilot/).
*Disclosure: I work on Linkjob AI.*