When I'm not able to understand Neetcode solutions, I come to this channel. It feels like you take time to explain in detail and cover small details and use a lot of test cases. Using multiple test cases helps understand the problem better. I subscribed long back. keep up the good work.
You are the most underrated guy. If I want to watch any problem in youtube at first I'm seeing if there is any video of yours that's the impact you gave. Really great explanation for many videos. Good luck keep posting❤
i usually used to check videos with shortest time, but since I started watching your approaches I ended up looking if your videos are there for the questions on priority
after watching these dp videos, i rechecked my "subscribed" button to check if it is subscribed or not. Great explanation, you are my goto while looking for linkedlist solutions or dp
Hi Sir, Eveytime I am searching for a leeetcode problem, I add your name in the suffix hoping you have done a video on it. I have understood each and every video that I have watched. Please do solve all the problems, that will be very helpful for people like me.
this solution isn't the most optimised one, atleast according to GFG. it's giving TLE, I really like how you explain, i would request you to make a new video with an accepted solution.
@nikhil Could you please explain how this solution works? I found this on leet code func lengthOfLIS(nums []int) int { arr := make([]int, 0) for _, num := range nums { if len(arr) == 0 || arr[len(arr)-1] < num { arr = append(arr, num) continue } // binary search arr find minimum element greater or equal with num l, r := 0, len(arr) - 1 for l
When I'm not able to understand Neetcode solutions, I come to this channel. It feels like you take time to explain in detail and cover small details and use a lot of test cases. Using multiple test cases helps understand the problem better. I subscribed long back. keep up the good work.
Dry run part is the best , you are the only one doing this , I can finally connect the code with the logic. Thank you !!!!
so happy you feel that way
one of the underrated channels you got 1 more subscriber your explanations are very satisfactory
Welcome aboard!
You are the most underrated guy. If I want to watch any problem in youtube at first I'm seeing if there is any video of yours that's the impact you gave. Really great explanation for many videos. Good luck keep posting❤
Nikhil, you are such an amazing teacher! I cannot understand this at all from university lecture but it makes complete sense coming from you!
love the way you explain the solutions, no one does like this.
I just wanna say thank you so much, you are the best programming instructor on youtube, no doubt!
what a great approach definitely everybody should watch i donot have words for your explanation just wow
Adding one to the maximum value is not required. BTW, thanks for your crystal clear explanation.
I feel like my brain does push ups when i learn from you, thanks bro!
i usually used to check videos with shortest time, but since I started watching your approaches I ended up looking if your videos are there for the questions on priority
Your video provided great clarity in understanding this challenging dynamic programming problem. Thanks!
after watching these dp videos, i rechecked my "subscribed" button to check if it is subscribed or not. Great explanation, you are my goto while looking for linkedlist solutions or dp
You have explained it way better.
An Impressive Guidance to this problem...
Sir, Really your explaination is super super simple !!!
I think it is tha most amazing yt channel
muah….muah…muah…chummi…chummi…chummi….God bless u bhai…top notch teacher….
WE WANT more series on dp .
wow the way you explain and make it easy is amazing bro you got a subscriber.Keep making amazing videos brother ..hats off and salute
You made the problem seem so easy! Thank you!
Thanks bro 🔥🔥🙌 found out the best video after lots of searching
Your search ends here 😄
it's tabulation not memoization
i was able to figure out this solution myself ,😁😁😁😁,,,just took a little help for code tho...thanks nikhil sir ur teaching is goated
I find your videos very helpful in preparation for my upcoming interview
Best of luck!
How was your interview?
Amazing brother I understand the problem and the solution too. THANKS TO YOU ❤
Most welcome 😊
loved the explanation, super easy you made it! thankyouuu!
Really clear, keep up the good work!
Great video. Clearly understood
Hats off to you what an amazing explanation :)
Thanks a lot 😊
best explanation u make dp easy with ur explanation thanku
Hi Sir,
Eveytime I am searching for a leeetcode problem, I add your name in the suffix hoping you have done a video on it. I have understood each and every video that I have watched. Please do solve all the problems, that will be very helpful for people like me.
Amazing explanation. Thank you for making this video
I like the way you teach
Thank you man for this. Nice explanation
wow ...........great explanation :) thank u sir 💟
great video I like the step by step instructions
Which drawing app you use to write this all on iPad? and btw great explaination and please do not forgot to give answer
👍
that is GoodNotes 6.
Great Explanation!!
Glad it was helpful!
Sorry, I have a quick question, What do you use to draw your diagramans?
That will be GoodNotes 6
Sir you are awesome. Thank you for this video ❤❤
Most welcome 😊
very nice sir
you are really awesome ❤🔥 thank you for Eever
You rock!
tooooo awesome man
this solution isn't the most optimised one, atleast according to GFG. it's giving TLE, I really like how you explain, i would request you to make a new video with an accepted solution.
Why we are adding +1 to return value ?
can you tell me why did you avoid using index 2 while backtracking and finding the longest sequence elements 26:00
Did you follow the entire logic of the solution explanation or went straight to the code?
@@nikoo28you mentioned to backtrack till zero but why u skipped only 2?
nice
Shouldn't it be "return maxIndex + 1" ? Can you check ?
Nikhil Lohia > Neetcode.
@nikhil Could you please explain how this solution works? I found this on leet code
func lengthOfLIS(nums []int) int {
arr := make([]int, 0)
for _, num := range nums {
if len(arr) == 0 || arr[len(arr)-1] < num {
arr = append(arr, num)
continue
}
// binary search arr find minimum element greater or equal with num
l, r := 0, len(arr) - 1
for l
Have you tried using a debugger?
bro please correct it O(n^2) is better than O(2^n) , that brute force is the better approach compared to recursion
just wow
Dear Nikhil I love you so much! from Pakistan, I would love to know about you personally! like what actually you do?
A software developer.
o