I will miss you, bro. You are the reason I started solving daily problems because I knew that whenever I got stuck, your videos were always there to help
Take rest bro. Watching your videos is one of the motivation that keeps me solve the leetcode problems. Stay healthy and sound. Hopefully, we can see you soon.
Thanks Navdeep for all your efforts on sharing the solution for Leetcode daily problems consistently everyday. We respect your time and completely understand you need a break.
You got me a motivation to solve problems daily. I work full time, but every day in the morning before work I solve daily coding challenge. That is keep going for a year. Your videos are clear and helpful. Thank you for noticing. Good luck and will wait for your coming back!
Hope things get sorted for you I'll kind of loose motivation now to do the daily problem, maybe its time for me to come up with the solutions on my own Hoping to see you soon Navdeep!
Thanks so much Neetcode! Totally understandable you need to take a break and fulfill other obligations! Best of luck and thank you so much for the explanation!
Thanks for your videos, they've been great and I'm sure many people have benefitted. I know I have. Wish you the best and hope you consider making more once you have had enough break
Thank you so much for that deque explanation - I managed to come up with the heap solution on my own but the deque had me a little baffled. Also, thank you for all your videos to date! Good luck with the obligations you need to take care of, and we hope to see you back again before too long.
The last solution you demonstrated could be optimized by eliminating the popLeft operation. In Python, it’s likely that arrays are used internally, making this operation costly as it requires removing the first element and shifting all others to the left, resulting in O(n) time complexity. By utilizing a `front` pointer instead, the process can be significantly sped up.
can someone tell me why 15:45 why we dont subtract cur_sum = cur_sum - min_heap[0][0] i mean if its small enough that we dont need to worry why not subtract it and push the updated sum ? so in the heap we aren't actually putting the correct minimum sum thats larger than or equal k right?
Neet, thanks a lot for all ur time and dedication u r my favorite youtuber by far, hope u come back soon 😢. But good Luck on your new jorney, and thanks a lot I'll trully miss u ❤
I will miss you, bro. You are the reason I started solving daily problems because I knew that whenever I got stuck, your videos were always there to help
Just wanted to let you know you are one of the most influential people I have come across my whole life. I love you neetcode
Take rest bro. Watching your videos is one of the motivation that keeps me solve the leetcode problems. Stay healthy and sound. Hopefully, we can see you soon.
Thanks Navdeep for all your efforts on sharing the solution for Leetcode daily problems consistently everyday. We respect your time and completely understand you need a break.
You got me a motivation to solve problems daily. I work full time, but every day in the morning before work I solve daily coding challenge. That is keep going for a year. Your videos are clear and helpful. Thank you for noticing.
Good luck and will wait for your coming back!
Damn man, hope you're doing well. Take some time to rest up. We'll miss you!
Hope things get sorted for you
I'll kind of loose motivation now to do the daily problem, maybe its time for me to come up with the solutions on my own
Hoping to see you soon Navdeep!
Thanks so much Neetcode! Totally understandable you need to take a break and fulfill other obligations! Best of luck and thank you so much for the explanation!
this is why you dont let negative people into yourlife
Thanks for all the videos, Neet! Looking forward to seeing these videos consistently again!
Will miss you so much Navdeep. Take some time to rest and hope to see you soon next year.
We’ll miss you, thanks for these great explanations! Get some well deserved rest.
0:10 That hit hard. You will be dearly missed!
4:53 interesting drawing
lmfaoo
Thank you for your dedication! I will miss you so much. I watched you every day last year. Hope you're doing well.
thanks for all ur efforts so far, hope u come back soon after sorting ur personnel commitments.
Thanks for your videos, they've been great and I'm sure many people have benefitted. I know I have. Wish you the best and hope you consider making more once you have had enough break
You're the best LeetCode UA-camr to me, thank you.
I was not aware about monotonic increasing order. I wrecked my head alot trying to solve this problem.
Thanks for the solution.
Thank you so much for that deque explanation - I managed to come up with the heap solution on my own but the deque had me a little baffled. Also, thank you for all your videos to date! Good luck with the obligations you need to take care of, and we hope to see you back again before too long.
Appreciate your explanation of why the sliding window would not work, that was my initial intuition to solving the problem.
Thank you so much bro... Will miss you
Thank you, your Leetcode videos are quite helpful especially when I have trouble at times with reading a barrage of text from written solutions.
i guess you spent much time to explain your thought in a simple way. Respect. Here I wait until your next leetcode video. Keep it up, bro!
Take rest bro. Gonna miss you, but tottaly understandable. you need to break.Hope to see you back soon.
neetcode i hope u know ill carry u with me everywhere i go
The last solution you demonstrated could be optimized by eliminating the popLeft operation. In Python, it’s likely that arrays are used internally, making this operation costly as it requires removing the first element and shifting all others to the left, resulting in O(n) time complexity. By utilizing a `front` pointer instead, the process can be significantly sped up.
Rest up bro, feel better. Hope to see you back soon!
Goated. You will be missed. Hope you come back soon
Just let you know you are one of the best and if you have to go wish you the best, thanks for all the help.
Thank you for your daily leetcode problem video, I hope to see you soon.
Man. Will definitely miss you. Thank you!
Will miss your leetcode videos bro😓
Thanks for being here for us all this time, hope to see you soon
can someone tell me why 15:45 why we dont subtract cur_sum = cur_sum - min_heap[0][0] i mean if its small enough that we dont need to worry why not subtract it and push the updated sum ? so in the heap we aren't actually putting the correct minimum sum thats larger than or equal k right?
You are a legend...will miss you :)
You deserve a rest bro. I am so grateful for all of your videos you have no idea how many people you have helped
You can insert {0, -1} in deque before starting the loop and remove "if(cur >= k) { res = min(res, i+1)}" for better understanding.
Neetcode, the red shirt looks stylish.
Take care brother. Everyone has storms in their lives.
thanks for all effort of creating a quality video daily. Hoping you start enjoying life more best of luck and don't burn out
Nooo please keep makin videos dude we love you for it
bro, I will miss u😩
You in the frame talking the solution makes it more easier than just voice. atleast i prefer this video format.
will miss you brother 😔
please take care of yourself Navdeep ❤
Thanks for making these daily videos, really appreciate the effort you put into them
WE GOT THE RED SHIRT FOR THE LEETCODE HARD
Awesome video! Thanks again.
Neet, thanks a lot for all ur time and dedication u r my favorite youtuber by far, hope u come back soon 😢.
But good Luck on your new jorney, and thanks a lot I'll trully miss u ❤
Hoping to see you soon!
Loved this, thanks so much
you are amazing, brother
24:30 Shouldn't it be (3:3)? 2 - 1 + 2
I will miss you, your videos so helpful
I'll miss you goat
thanks a lot awesome video
We will miss you bro😢. When will you come back?.
love your content thank you
such a good video, sad to see you go
You can do leetcode videos only for hard problems where you feel like you should talk about the problem.
But only if you feel healthy
Did you record screen before talking? I mean you are sitting calm and it doesn't seem you are drawing when you're talking. How is it so?
do come back soon🙃
Get some rest, mate. But please make sure to come back. I will be waiting.
Noooooooo! Will be waiting for you to come back)
You'll be missed as the only Indian (who I know) who doesn't have Indian English accent. Take care, man.
What are you cooking ?
Man had to bust out the red shirt for this one ☠
GOAT
🤶 🎄
Take time off until next year
you'll be missed
can you actually take a pic with a different shirt instead of just changing the color
Feeling so much hard
Consintency is really..
i like you
are u indian ?
a little bit yeah
No bro!!
yooo im first
first
broo don't doo that !!!!!🥲🥲🥲🥲🥲🥲
guy's telll him to not to do thatt, damnnn...
someday the hero has to go ... but always remember what our hero has taught us...
@@abhinavchoukse2357 yeahh, although 😔 hoping the NeetMan to be good and to come back after the rest.