Yandex Senior Software Engineer interview questions

Leetcode (easy and medium) and math questions

Given: 1. An array of sorted integers - a 2. Integer - N 3. Index of the element in the array - index It is necessary to return in any order K numbers from the array that are closest in value to the element a[index] . std::vector find_k_closest(const std::vector& a, size_t K, size_t index) Examples: find_k_closest(a={2, 3, 5, 7, 11}, K=2, index=3) -> {5, 7} find_k_closest(a={4, 12, 15, 15, 24}, K=3, index=1) -> {12, 15, 15} find_k_closest(a={2, 3, 5, 7, 11}, K=2, index=2) -> {3, 5} or {5, 7}