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 sorted integer array `arr`, two integers `k` and `x`, return the `k` closest integers to `x` in the array. The result should also be sorted in ascending order. An integer `a` is closer to `x` than `b` if `|a − x| < |b − x|`, or if `|a − x| == |b − x|` and `a < b`.
Example
arr = [1, 2, 3, 4, 5], k = 4, x = 3 → [1, 2, 3, 4]
Constraints
1 ≤ k ≤ arr.length ≤ 10⁴ · arr is sorted in ascending order · −10⁴ ≤ arr[i], x ≤ 10⁴
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.