Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Given an array of integers and a target value, return the indices of two numbers that add up to the target
Coding
- Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand (e.g., [4,5,6,7,0,1,2]). Search for a target value and return its index, or -1 if not found. Required time complexity: O(log n).
Coding
- Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the k closest points to the origin (0, 0). Discuss expected vs. worst-case time complexity.
Coding
- Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Glassdoor · 1 record
Meta
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.
Reported date not specified · 1 source report
Software Engineer
Source snapshot: Nov 12, 2026
View source