 All Problems
Find K Closest Elements
medium
binary search
array
two pointers
amazon
google
facebook

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:

Input: arr = 1 2 3 4 5, k = 4, x = 3
Output: 1 2 3 4

Example 2:

Input: arr = 1 2 3 4 5, k = 4, x = -1
Output: 1 2 3 4

Input format: First line: arr. Second line: k. Third line: x.

Output format: k closest elements in sorted order.

Run to check your code against the sample cases, or submit to run every case