#658

Find K Closest Elements

medium · 49.5% accepted · 9,012 likes · top 36%

array · two pointers · binary search · sliding window · sorting · heap (priority queue)

⊣ practice⊣ open on leetcode ↗

Description

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

Solution