ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
Best in buisness, Thanks NIkhil
i think there is some error at timestamp 12:02high = mid -1 and mid = 2 so high should be 2-1 = 1 but you wrote 2
you are correct. I missed some values while doing the dry-run, but the code works for sure.
yes i also found the same
Thank you for teaching this. You are doing a great job.
Thanks! After watching many videos, finally find one I can understand....
So happy you found it useful :)
your explanations is the best sir you deserve more followers ♥♥♥♥♥♥♥♥♥♥♥Thanks for the video sir
Thanks for the lovely comment.
your teaching is good, I wached so many videos but dont understand about last part. But from your video I got that. keep it up and thanks
Thanks for your kind comment :)
I love your talking speed ❤😊 it really helps to understand the solution
so happy to read this :)
best explanation sir... i have ever followed. please keep continue
Good explanation. Please do more videos on Leet Code problems. Appreciate your efforts !
Thank you!
thank you🥰
Thank u sir
So nice of you
Thanks.
Awesome explanation 🙂
Last approach gives TLE. time lime execced.Code :-class Solution: def searchInsert(self, nums: List[int], target: int) -> int: l = 0 h = len(nums) - 1 while(l target : h = mid -1 else: l = mid +1 return l
try putting some print statements in your code to get the values of l, mid and h....that will help you. Most likely you are running into an infinite loop.
@@nikoo28 yes it works. Thank you so much
greate explantion bro..
Thank you for the content
Always welcome 😄
teacher we want at our colleges
this code at the end doesn't pass the leetcode pre tests though...
Check the code in the video description :)
@@nikoo28 yeahh my bad it works, my while() condition was while(low!=high) but you had low
👌👌👌👌
thank u sir
Best in buisness, Thanks NIkhil
i think there is some error at timestamp 12:02
high = mid -1
and mid = 2 so high should be 2-1 = 1 but you wrote 2
you are correct. I missed some values while doing the dry-run, but the code works for sure.
yes i also found the same
Thank you for teaching this. You are doing a great job.
Thanks! After watching many videos, finally find one I can understand....
So happy you found it useful :)
your explanations is the best sir
you deserve more followers ♥♥♥♥♥♥♥♥♥♥♥
Thanks for the video sir
Thanks for the lovely comment.
your teaching is good, I wached so many videos but dont understand about last part. But from your video I got that. keep it up and thanks
Thanks for your kind comment :)
I love your talking speed ❤😊 it really helps to understand the solution
so happy to read this :)
best explanation sir... i have ever followed. please keep continue
Good explanation. Please do more videos on Leet Code problems. Appreciate your efforts !
Thank you!
thank you🥰
Thank u sir
So nice of you
Thanks.
Awesome explanation 🙂
Last approach gives TLE. time lime execced.
Code :-
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
l = 0
h = len(nums) - 1
while(l target :
h = mid -1
else:
l = mid +1
return l
try putting some print statements in your code to get the values of l, mid and h....that will help you. Most likely you are running into an infinite loop.
@@nikoo28 yes it works. Thank you so much
greate explantion bro..
Thank you for the content
Always welcome 😄
teacher we want at our colleges
this code at the end doesn't pass the leetcode pre tests though...
Check the code in the video description :)
@@nikoo28 yeahh my bad it works, my while() condition was while(low!=high) but you had low
👌👌👌👌
thank u sir