unreasonably effective

class Solution:
    def find_insert_index(self, x, nums):
        lo, hi = 0, len(nums)-1
        while lo <= hi:
            mid = (lo+hi) // 2
            if nums[mid] < x:
                lo = mid+1
            else:
                hi = mid-1

        return lo

    def findClosestElements(self, arr: List[int], k: int, x: int) -> List[int]:
        n = len(arr)
        right = self.find_insert_index(x, arr)
        left = right-1
        elements = deque()
        while len(elements) < k:
            if left < 0:
                elements.append(arr[right])
                right += 1
                continue
            
            if right >= n:
                elements.appendleft(arr[left])
                left -= 1
                continue
            
            left_dist = abs( arr[left] - x )
            right_dist = abs( arr[right] - x )
            if left_dist <= right_dist:
                elements.appendleft(arr[left])
                left -= 1
            else:
                elements.append(arr[right])
                right += 1

        return list(elements)