The 3 Levels of Binary Search
Vložit
- čas přidán 28. 08. 2024
- When most people think of Binary Search, they think of finding a number in a sorted array. And while that IS binary search, there's a lot more that you can do with it than that.
Especially in coding interviews when interviewers ask more involved problems, understanding the complexities of binary search can be really valuable.
In this video, I'll show you some of the different ways that you can apply binary search to interview problems.
RESOURCES & LINKS MENTIONED IN THIS VIDEO:
[Free Training] Minimum Viable Interview Prep: www.byte-by-by...
Coding Interview Questions and Answers Playlist: • Interview Question: Fi...
YOU CAN ALSO FIND ME HERE
Website: www.byte-by-by...
Twitter: / bytebybyteblog
Facebook: / bytebybyteblog
Your lectures are great. Could you do more videos like this breaking it down from Easy to Hard levels? This is my first time engaging with your video channel!
Much appreciated. Definitely planning to do more videos like this
And that's not the end of it, A lot of problems have a "Hidden", or rather obscure Binary Search Solution. One good example is the "Kth Smallest element in a sorted Matrix" problem.
Yeah for sure. Kinda like graph problems where they're completely non-obvious
Like Kokos eating bananns problem
you are a legend amongst algo tutors.
recent business graduate. have technical interviews with apple and amazon. (project managers liked my side projects). also have been coding since a kid.
have never taken an exam for algos + ds. and you have helped me tremendously this week.
the array tricks / middle school math i learnt earlier is golden!
seeing your comment after a year. How did you do
this is the only video available on youtube which talks about this concept
Great lecture, thank you
Glad you found it helpful :)
Great lecture! I wonder if we can optimize the last problem using a running sum.
GREAT, pleaase more kind of this video
I'm not understanding how 2 is less than 7 but 1 is greater than 7.. shouldn't 2 be greater than 7 also?
No price for your bootcamp?
The most important part (3) is underelaborated
arr = list(map(int, input().split()))
num = int(input())
l = 0
r = len(arr) - 1
cnt = 0
while l
Extremely hard to follow tut
Yes he is mr beasts brother.
you look like mrbeast
I wanted to watch the video but your light mode screen is blinding me. Please use a black slate