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.
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
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.
@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
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.
one of the underrated channels you got 1 more subscriber your explanations are very satisfactory
Welcome aboard!
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.
I just wanna say thank you so much, you are the best programming instructor on youtube, no doubt!
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
what a great approach definitely everybody should watch i donot have words for your explanation just wow
WE WANT more series on dp .
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
Amazing brother I understand the problem and the solution too. THANKS TO YOU ❤
Most welcome 😊
Sir, Really your explaination is super super simple !!!
I think it is tha most amazing yt channel
You have explained it way better.
An Impressive Guidance to this problem...
I feel like my brain does push ups when i learn from you, thanks bro!
Great video. Clearly understood
loved the explanation, super easy you made it! thankyouuu!
You made the problem seem so easy! Thank you!
i was able to figure out this solution myself ,😁😁😁😁,,,just took a little help for code tho...thanks nikhil sir ur teaching is goated
Really clear, keep up the good work!
Thanks bro 🔥🔥🙌 found out the best video after lots of searching
Your search ends here 😄
I find your videos very helpful in preparation for my upcoming interview
Best of luck!
How was your interview?
Amazing explanation. Thank you for making this video
best explanation u make dp easy with ur explanation thanku
muah….muah…muah…chummi…chummi…chummi….God bless u bhai…top notch teacher….
great video I like the step by step instructions
Thank you man for this. Nice explanation
Hats off to you what an amazing explanation :)
Thanks a lot 😊
wow ...........great explanation :) thank u sir 💟
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.
Great Explanation!!
Glad it was helpful!
you are really awesome ❤🔥 thank you for Eever
You rock!
Sir you are awesome. Thank you for this video ❤❤
Most welcome 😊
tooooo awesome man
Shouldn't it be "return maxIndex + 1" ? Can you check ?
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.
bro please correct it O(n^2) is better than O(2^n) , that brute force is the better approach compared to recursion
Sorry, I have a quick question, What do you use to draw your diagramans?
That will be GoodNotes 6
@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?
nice
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?
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 Lohia > Neetcode.
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