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!
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.
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
This is very helpful, thank you!
Great lecture! I wonder if we can optimize the last problem using a running sum.
this is the only video available on youtube which talks about this concept
Great lecture, thank you
Glad you found it helpful :)
GREAT, pleaase more kind of this video
No price for your bootcamp?
I'm not understanding how 2 is less than 7 but 1 is greater than 7.. shouldn't 2 be greater than 7 also?
11:05 it's greater than 7 OR less than 3 , similarly the next group will be greater than 7 OR less than 2 and so on ...
Extremely hard to follow tut
arr = list(map(int, input().split()))
num = int(input())
l = 0
r = len(arr) - 1
cnt = 0
while l
The most important part (3) is underelaborated
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