I watched many videos on this problem, you got the best and easy to follow and understand. Thank you so much. I was able to solve this just with your explanation.
What a great explanation man🎉🙌🙌. I am only referring to your solutions for all the problems that u have solved. Definitely your vedios will boost confidence among all the beginners. Thank you ❤
How are you able to explain with no difficulty, when I try to make someone understand about my own way of solving a problem I stumble since I wont be able to even understand how I got the solution Can you help me how I can resolve this and make things clear ? also your explanation was flawless able to solve the problem now thanks !!
Bhai maja aa gaya tumhara explanation dekh kar... Isse pehle mujhe Yeh waala method samjh nahi aa raha tha... Or sirf Hashmap waala method hi aata tha... Thanks Bro
great explanation video i would highly reccomend you to use some dark color background like dark green , dark blue the white board irritating to eyes man. 😘 love your content.
Everyone recommend another channel for beginners to learn solving leetcode problems., but i highly recommend nikhil lohia for beginners. Thank you brother🎉
I don't know if you have time to see comments. Thank you for the solution. I have a question. We are creating n extra nodes ( copied node). So, is the space O(n) ? How is it O(1) ? We are modifying by adding more nodes.
We are using that space just to return the answer, but not to solve the question... Space complexity will be considered if we are using some space to solve a problem.
Watched other's videos to understand the solution of this problem, found them very confusing. Your explanations are crystal clear.
found very difficulty to understand this problem after watching your video it was very much clear and understandable to solve Thank You 😊
I watched many videos on this problem, you got the best and easy to follow and understand. Thank you so much. I was able to solve this just with your explanation.
Great to hear!
What a great explanation man🎉🙌🙌. I am only referring to your solutions for all the problems that u have solved. Definitely your vedios will boost confidence among all the beginners. Thank you ❤
How are you able to explain with no difficulty, when I try to make someone understand about my own way of solving a problem I stumble since I wont be able to even understand how I got the solution Can you help me how I can resolve this and make things clear ? also your explanation was flawless able to solve the problem now thanks !!
Bhai maja aa gaya tumhara explanation dekh kar... Isse pehle mujhe Yeh waala method samjh nahi aa raha tha... Or sirf Hashmap waala method hi aata tha... Thanks Bro
Very good explanation 😃 love your videos
Definitely it will be clear explanation for absolute beginners
Extremely well explained. Thank you!
You're very welcome!
Really great explanation. Thank you so much 🙏
loved the explanation!
Whenever i search questions related to leetcode on UA-cam at last i just add nikhil lohia❤
Great explanation, thanks!!
best explanation❤
That was a great explanation. Thank you.
Best one!
thanks bhaiya
great explanation video i would highly reccomend you to use some dark color background like dark green , dark blue the white board irritating to eyes man. 😘 love your content.
It is difficult to make diagrams on a dark background. Will keep using white for now
super duper cool, I need python code for the same
thankyou sir
Everyone recommend another channel for beginners to learn solving leetcode problems., but i highly recommend nikhil lohia for beginners. Thank you brother🎉
it's very digestive explanation
I don't know if you have time to see comments. Thank you for the solution. I have a question. We are creating n extra nodes ( copied node). So, is the space O(n) ? How is it O(1) ? We are modifying by adding more nodes.
We are using that space just to return the answer, but not to solve the question...
Space complexity will be considered if we are using some space to solve a problem.
can we do it using hashmap?
Great explanation, thanks!!