Question Details
LeetCode #658: Find K Closest Elements. Difficulty: Medium. Topics: Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue). Asked at Yandex in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a reported interview question from a yandex interview for a swe role during the coding round.
It covers the following topics: Heap (Priority Queue), Arrays, Binary Search, Heap, Queue, Sliding Window, Sorting, Two Pointers .
Difficulty rating: Medium