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 be sorted in ascending order.

Examples

Example 1:

Input:

arr = [1,2,3,4,5]
k = 4
x = 3

Output:

[1,2,3,4]
Loading...
K Closest Elements - Binary Search DSA Problem