this is what i was looking for. The video has explanation of 12 min and 4 min on coding part. Very few youtubers does this. I like your approach. Thank you
update: I really appreciate these tutorials and plan to support your work soon. I had requested coverage on algorithms' time and space complexity, but Nikhil made me realize they are already included in the videos. Thanks for providing such valuable content. Big thanks and God bless you!
@@nikoo28 My bad! I'll make sure to reach the end of the videos. I usually pause towards the end to convert the code into Python, which is probably why I haven't finished most of them. Thanks!
I code in cpp, and your solutions are in java, it turns out to be pretty productive for me because i cannot copy it directly and had to use my own brains for the sake of doing the problem hehe...love your videos
Hi sir, actually I seen Ur backtracking video, very simple explanation I understand easily i commented in that video to make problem solving videos, I didn't get how to solve. thankyou 😊
you are mistaken at 2:04 to say that Subtree 5, 1, 4 satisfies the criteria of a binary search tree. Clearly the right child (4) is less than the parent (5)
Actually, in the first example, you selected node 5 to check if it satisfies the bst rule and said it does but i think it doesn't. The roght child should be larger than the node, shouldn't it?
@@nikoo28 sir I have lots of respect for you , others UA-cam videos just try to finish the code as fast as possible but you explain in best manner. So I gave a devil emojis. You explanation is far better than paid course
It doesn't matter how long the video is... Clarity is the key to understand and you have it in your videos. Keep it up!
i know...sometimes the video gets a little long
Every time I search for a problem explanation on youtube, I have this immediate sigh of relief, if your video shows up 😁
this is what i was looking for. The video has explanation of 12 min and 4 min on coding part. Very few youtubers does this. I like your approach. Thank you
Glad you liked it!
Great aproach Nikhil, you are a saviour
update: I really appreciate these tutorials and plan to support your work soon. I had requested coverage on algorithms' time and space complexity, but Nikhil made me realize they are already included in the videos. Thanks for providing such valuable content. Big thanks and God bless you!
I talk about the time and space complexity in every problem. It is always near the dry-run of the code
@@nikoo28 My bad! I'll make sure to reach the end of the videos. I usually pause towards the end to convert the code into Python, which is probably why I haven't finished most of them. Thanks!
I code in cpp, and your solutions are in java, it turns out to be pretty productive for me because i cannot copy it directly and had to use my own brains for the sake of doing the problem hehe...love your videos
Thanks, my brother. You're explanations really help me understand.❤
You are very welcome
Hi sir, actually I seen Ur backtracking video, very simple explanation I understand easily i commented in that video to make problem solving videos, I didn't get how to solve.
thankyou 😊
All the best
great explanation, thanks for doing this!
good explanation always, 😀
very nice explanation please keep making such videos
Great Explaination .Pls keep making more vidoes
you are mistaken at 2:04 to say that Subtree 5, 1, 4 satisfies the criteria of a binary search tree. Clearly the right child (4) is less than the parent (5)
Yup, author made a slight mistake there.
fab explanation
Great explanation!
Very well explained!
Glad it was helpful!
what a solution !!
Thanks, so simple
Actually, in the first example, you selected node 5 to check if it satisfies the bst rule and said it does but i think it doesn't. The roght child should be larger than the node, shouldn't it?
Hi Nikhil how you are using this red hi-lighter while explaining could you pls tell.. it's look nice.. which tool you are using for Presentation
that will be GoodNotes 6 on iOS
It will be better if you will explain iterative and recursive both of solution of every problem
Others UA-cam videos🤡🤡
Nikhil sir 👿👿
why the angry devil??
@@nikoo28 sir I have lots of respect for you , others UA-cam videos just try to finish the code as fast as possible but you explain in best manner. So I gave a devil emojis. You explanation is far better than paid course