Problem · Array
K Closest Elements in a Sorted Array
● Medium
AmazonFULLTIMEPHONE SCREEN
See Amazon hiring insightsAmazonFULLTIMEPHONE SCREENProblem statement
Given an integer array arr sorted in nondecreasing order, an integer k, and a target x, return the k values closest to x in ascending order.
The problem statement continues
ProExamples
Example 1
arr = [-10,-4,-1,3,8,12]k = 4x = 2return = [-4,-1,3,8]Values -4 and 8 are equally distant from 2; the smaller value wins the boundary tie.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week