Solution: Find K Closest Elements
Let's solve the Find K Closest Elements problem using the Modified Binary Search pattern.
Statement
You are given a sorted array of integers, nums
, and two integers, target
and k
. Your task is to return k
number of integers that are close to the target value, target
. The integers in the output array should be in a sorted order.
An integer, nums[i]
, is considered to be closer to target
, as compared to nums[j]
when |nums[i]
- target
| |nums[j]
- target
|. However, when |nums[i]
- target
| |nums[j]
- target
|, the smaller of the two values is selected.
Constraints:
-
k
nums.length
-
nums.length
nums
is sorted in ascending order.-
nums[i]
,target
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.