Great video, subscribed 💚. And may I ask a question? How do you write this in JavaScript when it's not available in the JavaScript category? What i mean is that whenever i click on the JavaScript questions there are only around 20 30 questions and no sign of this question that you're solving.
Javascript category is a different thing - usually to implement stuff like built-in methods etc. , you need algorithms section, there you can code in any language
Thank you so much! Liked and subscribed 🙏🏾❤️
This got upgraded to medium difficulty since you posted this.
Nice explanation. Very clear! Thank you.
Very nice, one of the best recursive examples
Thanks wabbit, keep on grinding leetcode!
Awesome solution. This was really helpful for me!
Glad it helped!
Thank you for your explanation, really helps me a lot.
Anytime Derso, thanks for watching 👍
Great video, subscribed 💚.
And may I ask a question?
How do you write this in JavaScript when it's not available in the JavaScript category?
What i mean is that whenever i click on the JavaScript questions there are only around 20 30 questions and no sign of this question that you're solving.
Javascript category is a different thing - usually to implement stuff like built-in methods etc. , you need algorithms section, there you can code in any language
@@alexgabriel5877 oh interesting. tnx for the reply man
Can’t we do a binary search for the node that is between p and q ? - that way it would be O(log N)
thanks again
No problem Seth
I’d like to see this in Python.
What if p == q? I think it wouldn’t work