Leetcode 658. Find K Closest Elements

Given a sorted array, return the k integers closest to x (ties broken by smaller value) in ascending order. Use the sorted property to locate the optimal contiguous window of size k (e.g., via binary search on the window start or two-pointer shrinking).

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid July, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 658. Find K Closest Elements

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact