6:04 actually, we are not just "allowed" to do that. That's the only way it accepts it. I coded exactly the same solution and could not understand why it didn't work. The catch is, we need it only for the second while loop because at that point left pointer has advanced but r has not and they might have the same index. You can check how it works on the string "aa".
I solved it 9 hours ago and searching your video but you did not upload it ,i searched for it 20 minutes ago also. Without seeing your video it feels like did not solve the problem .
Same bro. Same. I legit searched to see if there was a Neetcode solution and was surprised i didn't see anything. Eventually had to watch someone else's (p.s: the guy didn't bother explaining and my appreciation of Neetcode's effort increased ×10).
Hi, guys. I little a bit have an issue. Please direct me to a right wat. How can we be here greedy. We are using two pointers: left and right. aabccabba . Left pointer should take 2 a’s and right pointer should take 1 a. In general, here we are using loop while l
hello mr neetcode, i bet a lot of people would be interested for you to cover solutions to leetcode weekly contests on a weekly/biweekly kind of schedule
A bit late, but thank you. Luckily the solution doesn't locked behind the premium so I could still learn the solution. But your explanation is so much better though.
Thanks I want to pursue Data Science but still watching your videos cause you make DSA fun
6:04 actually, we are not just "allowed" to do that. That's the only way it accepts it. I coded exactly the same solution and could not understand why it didn't work. The catch is, we need it only for the second while loop because at that point left pointer has advanced but r has not and they might have the same index. You can check how it works on the string "aa".
You sound like you just woke up, hope you're feeling okay!
I don't even know where to start on a problem like this but watching your video makes me get it right away... Thank you!
OMG, I was so close to the solution on my own, the only place I messed up was `while s[l] == curr and l
Late but consistent !! Love your videos.
I solved it before you uploaded HAHAHAHAHAHAHA OWNED! Jk man I love you
Logically it should be l < r, but that doesn't submit only l
IG u would understand it better if u do a dry run on the string "cabaabac", using both the conditions.
to put it shortly, l
Would you be able to do a video going over Leetcode 1312 (Minimum Insertion Steps to Make a String Palindrome)? Thank you so so much!
I solved it 9 hours ago and searching your video but you did not upload it ,i searched for it 20 minutes ago also. Without seeing your video it feels like did not solve the problem .
Same bro. Same. I legit searched to see if there was a Neetcode solution and was surprised i didn't see anything. Eventually had to watch someone else's (p.s: the guy didn't bother explaining and my appreciation of Neetcode's effort increased ×10).
Yo I'm so early. Thanks Navdeep for your great videos ! :D Also how are you?
Are you adding these questions to “neetcode all”? Because I could not find this question in that list. Btw big thanks for vast knowledge base
these are the daily problems
these are the daily problems
Thanks a lot my friend,
Could you please help on explaining "745. Prefix and Suffix Search"?
thank you
🎉🎉
Hi, guys. I little a bit have an issue. Please direct me to a right wat. How can we be here greedy. We are using two pointers: left and right. aabccabba . Left pointer should take 2 a’s and right pointer should take 1 a. In general, here we are using loop while l
l
hello mr neetcode, i bet a lot of people would be interested for you to cover solutions to leetcode weekly contests on a weekly/biweekly kind of schedule
A bit late, but thank you. Luckily the solution doesn't locked behind the premium so I could still learn the solution. But your explanation is so much better though.
Man are you OK? Where is the todays problem?