How should I practice Find K Closest Elements in a Sorted Array?

Start by reading the full statement, solve the visible examples, then compare the pattern against related LinkedIn onsite interview problems in FastPrep.

Is Find K Closest Elements in a Sorted Array associated with LinkedIn?

FastPrep tags this as a LinkedIn onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Find K Closest Elements in a Sorted Array

Learn this problem

● Medium

LinkedInFULLTIMEONSITE INTERVIEW

Problem statement

Given a sorted integer array arr, an integer k, and a target x, return the k closest values to x in ascending order.

A value a is closer than b when |a - x| < |b - x|. For equal distances, the smaller value is closer.

Function

findClosestElements(arr: int[], k: int, x: int) → int[]

Examples

Example 1

arr = [1,2,3,4,5]k = 4x = 3return = [1,2,3,4]

The four smallest distances belong to 1, 2, 3, and 4.

Example 2

arr = [1,2,3,4,5]k = 4x = -1return = [1,2,3,4]

The target lies left of the array, so the first four values are closest.

Constraints

arr is non-empty and sorted in nondecreasing order.
1 <= k <= arr.length.
All values and x are signed integers.