[Java] Leetcode 658. Find K Closest Elements [Binary Search #8]

preview_player
Показать описание
In this video, I'm going to show you how to solve Leetcode 658. Find K Closest Elements which is related to Binary Search.

Here’s a quick rundown of what you’re about to learn:

⭐️ Course Contents ⭐️
⌨️ (0:00) Question
⌨️ (3:01) Solution Explain
⌨️ (12:57) Code

In the end, you’ll have a really good understanding on how to solve Leetcode 658. Find K Closest Elements and questions that are similar to this Binary Search.

  1. Eric Programming
  2. leetcode Find K Closest Elements
  3. leetcode 658
  4. leetcode 658 Find K Closest Elements
  5. 658 Find K Closest Elements
  6. eric programming leetcode 658
Рекомендации по теме
[Java] Leetcode 658. 0:15:06

[Java] Leetcode 658. Find K Closest Elements [Binary Search #8]

Find K Closest 0:18:21

Find K Closest Elements - Leetcode 658 - Python

658. Find k 0:11:42

658. Find k closest elements | Leetcode | Medium | Java | Binary Search | Two Pointers

Find K Closest 0:12:45

Find K Closest Elements | Leetcode 658 | Live Coding session

LeetCode 658 | 0:05:02

LeetCode 658 | Find K Closest Elements | Linear Search | Java

Find K Closest 0:10:40

Find K Closest Elements | LeetCode 658 | Coders Camp

Google Coding Interview 0:21:47

Google Coding Interview Question | Leetcode 658 | Find K Closest Elements

Leet Code 658 0:05:55

Leet Code 658 || Find K Closest Element || Debug || Java

LeetCode 658. Find 0:18:44

LeetCode 658. Find K Closest Elements | JSer - JavaScript & Algorithm

Find K Closest 0:11:24

Find K Closest Elements | LeetCode 658 | Java | Binary Search | @LearnOverflow

LeetCode 658. Find 0:18:12

LeetCode 658. Find K Closest Elements | Java | Binary Search

658. Find K 0:02:28

658. Find K Closest Elements | LEETCODE MEDIUM

LeetCode 658. Find 0:10:09

LeetCode 658. Find K Closest Elements

Find K Closest 0:24:46

Find K Closest Elements | Leetcode 658 Solution | Searching and Sorting

LeetCode 658: Find 0:06:29

LeetCode 658: Find K Closest Elements: Python Medium

Find K Closest 0:12:30

Find K Closest Element| LeetCode 658 |Java| Binary Search |Two Pointer| @code_period

Find K Closest 0:25:46

Find K Closest Elements - Optimised Approach | Leetcode 658 Solution | Searching and Sorting

Find K Closest 0:06:46

Find K Closest Elements - Leet Code 658

Coding Interview: Find 0:19:14

Coding Interview: Find K Closest Elements

Leetcode 658 Find 0:14:15

Leetcode 658 Find K Closest Elements

658. Find K 0:17:57

658. Find K Closest Elements - Day 2/31 Leetcode July Challenge

Coding Interview Problem 0:07:18

Coding Interview Problem - Find K Closest Elements

leetcode 658. Find 0:24:40

leetcode 658. Find K Closest Elements - 3 sols: 1. sorting key; 2. sliding window; 3. binary search

Find K Closest 0:23:21

Find K Closest Elements 🔥🔥 | 3 approaches | Brute + Better + Optimal | Leetcode 658 | C++ | Python...

Комментарии
Автор

very good explanation 5:46 this is where i didn't get it. im glad i found this video

sproutboot
Автор

Best explained solution for this problems I have ever found. Thank you for the work!

DongmingWu-ex
Автор

great video! thanks for sharing. It'd be better if you could explain (14:25) why one one condition, it's left = mid + 1, while right = mid on the other ?

pengx
Автор

It's good. Just that it would be great if you would have added the reason as to why we move (r = mid) and not (r = mid-1).
I think that's that part in Binary Search related problems where many people get confused.

And Thanks for the video. It was great.

mazhar
Автор

Didn't pass the test case: [1, 1, 2, 2, 2, 2, 2, 3, 3] 3 3. "right = arr.length - k" excluded the most right part of the array got checked.

wendywang
Автор

Isn't the first solution O(log n + k)? Cuz we might end up having to compare nearly all numbers in the array depending on k.

borazanabi