Find K Closest Elements
Try to solve the Find K Closest Elements problem.
We'll cover the following...
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]
...
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy