Find K Closest Elements

Given a sorted integer array arr, two integers k and x, return the k closest integers to x.

If |a - x| == |b - x|, the smaller number is chosen. The internal array must be sorted.

Example:

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

Approach 1: Max-Heap (Standard Top-K)
Similar to previous problems, maintain a Max-Heap of size K.

• Priority is distance |val - x|.
• Pop the element with the largest distance if size > K.

Approach 2: Two Pointers (Optimal for Sorted Input)
Since the array is sorted, the K closest elements will be a contiguous subarray.

1. Use Binary Search to find the closest element to x.
2. Expand Left and Right pointers to collect K neighbours.

Visualizing the selection process.