Bifalgorithm post

Given a sorted array, find the k closest elements to x, but exclude x itself. Use binary search to find x's position, then expand two pointers left and right to pick the k closest values by comparing distance. Runs in log n+k time. Like this? Hit subscribe for more clean code tips.

Given a sorted array, find the k closest elements to x, but exclude x itself. Use binary search to find x's position, then expand two pointers left and right t…