Find K Closest Elements

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 an integer b if:

  • |a - x| < |b - x|, or
  • |a - x| == |b - x| and a < b
Example 1
Inputarr = [1,2,3,4,5], k = 4, x = 3
Output[1,2,3,4]
The four integers closest to 3 are 1, 2, 3, and 4, returned in ascending order.
Example 2
Inputarr = [1,1,2,3,4,5], k = 4, x = -1
Output[1,1,2,3]
The four integers closest to -1 are 1, 1, 2, and 3, returned in ascending order.

Constraints

  • 1 <= k <= arr.length
  • 1 <= arr.length <= 10^4
  • arr is sorted in ascending order.
  • -10^4 <= arr[i], x <= 10^4

Asked at 19 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate