Case Briefing
Before you solve the case
Read the Sorted Evidence
Every sorted pair-sum investigation begins with three questions:
- What one-indexed positions must the Answer Space return?
- What does the sorted Problem Space prove about movement?
- Which boundary can move when the Candidate Pair is too small or too large?
Case File #003 teaches you how to read sorted order as evidence and derive a Two-Boundary Scanner before writing code.
Primary lesson: Sorted structure can replace external memory when it proves which boundary movement preserves every still-lawful pair.
Two-Boundary Simulator
Run the active pair investigation
Advance one Frame at a time. Watch the comparison identify which boundary may move without violating the Invariant.
Problem Statement
Given a sorted integer array numbers and an integer target, return the one-indexed positions of the two distinct values whose sum equals the target.
Exactly one solution is guaranteed.