Coding Interview: Find K Closest Elements

Подписаться 13 тыс.

Просмотров 3,6 тыс.

50% 1

Introduction and solution on the Find K Closest Elements coding interview. Variations of this algorithm have been asked by a few big tech companies such as Google, Facebook, Microsoft, Netflix, Amazon, so it's important to know how to solve it efficiently.
Please support me through my Udemy courses:
Pass your coding interview in,
Java : www.udemy.com/...
Python: www.udemy.com/...
Ruby: www.udemy.com/...
JavaScript: www.udemy.com/...
Multithreading in,
Go Lang: www.udemy.com/...
Python: www.udemy.com/...
Java: www.udemy.com/...
Learn Dynamic Programming in,
Java: www.udemy.com/...
Python: www.udemy.com/...
Ruby: www.udemy.com/...

Опубликовано:

9 сен 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 7

@shristisrivastava7054 12 дней назад

Very clear explanation. Thanks for posting this video.

@empowercode 2 года назад

Hey James, great video! Particularly, I like how clear and detailed your explanations are as well as the depth of knowledge you have surrounding the general programming approach. Since I run a tech education channel as well, I love to see fellow Content Creators sharing, educating, and inspiring a large global audience. Keep up the great work!

@lvkaz 2 года назад

This content is so underrated! Keep up the excellent work. I hope You will get a lot of recognition soon for such great explanations!

@vijayakumareyunni6010 10 месяцев назад

Excellent explanation and solution

@Adaetro 2 года назад

Since array is ordered what if you stop the cycle when current abs_sum is higher then previous abs_sum? In the first example since abs_sum of [8 , 9, 10] = 3 and previous abs_sum of [7, 8, 9] = 2 then there is no point in calculating [9, 10, 13] since abs_sum is only going to increase from now on?

@Adaetro 2 года назад

def find_closest_elements(arr, k, x): abs_list = list(map(lambda n:abs(n-x), arr)) prev_abs_sum = abs_sum_min = abs_sum = sum(abs_list[0:k]) min_i = 0 for i in range(1, len(arr)-k+1): abs_sum = abs_list[i+k-1] + abs_sum - abs_list[i-1] if prev_abs_sum < abs_sum: break if abs_sum < abs_sum_min: abs_sum_min = abs_sum min_i = i prev_abs_sum = abs_sum return arr[min_i:min_i+k], i #print number of loops print(find_closest_elements([5, 7, 8, 9, 10, 13], k=3, x=8))