Unique Binary Search Trees II | Leetcode 95 | Live coding session 🔥🔥🔥

Here is the solution to "Unique Binary Search Trees II" leetcode question. Hope you have a great time going through it.

1) 0:00 Explaining the problem out loud
2) 1:10 Algorithm walkthrough
3) 4:30 Solution approach
4) 7:00 Coding

For discussion/feedback

PS : Please increase the speed to 1.25X

[Coolharshit]

Wow buddy, awesome explanation and power of recursion.

[gourav.barkle]

This is really good, Thank you for this.

[LegitGamer]

eagerly waiting for todays question !!

[vadirajjahagirdar]

I understood thoroughly. Keep up the good work.

[disunique]

You are a saviour ... Whenever I. Found a doubt
1) Go to leetcode Discuss
2) if(! understood)
Coding decoded bhaiya video ...
3) return concept clear. 😂

[dhruvdhiman]

Thank you for this!!
Could you also please talk about time and space complexity?

[avdd]

Great explanation and solution as usual. But this would be a nightmare to code in C (that's my goto language). 😞

[rajivsarkar]

it would be better if the recursive tree diagram is also explained.

[okeyD]

This solution is all over the internet, how can someone come up with this solution during interviews? Also you missed a lot of key points and main edge case when you were discussing about your code.

[shrimpo]

plz keep on doing the monthly challenge! I love it very much!

[sulthanmogal]

thank you😍😍..bro whats time complexity fr this ?

[paragroy]

Nice explanation sir...thanks a lot for the video.
A small suggestion sir it will be really good if you also discuss the space and the time complexity at the end.

[Muthuvlog]

Thanks for the clear explanation, for the input of integer - > 3

can you please tell me, why aren't we considering the possibility of the below tree as well?

2
/ \
null 3
/ \
1 null

[newdreamza-z]

The time complexity looks like T(N) = 2(T(1) + T(2) +T(3) + i correct?What is the asymptotic bound for it?

[codingalways]

Solution video of today's problem? Please upload it, I am eagerly waiting for your approach. Could not solve it today.

[samiahmadkhan]

you skipped the most crucial edge case which is when start > end. Can you please explain that logic?

[bongcoder]

what is the time complexity of the above approach...can you please tell

[raht]

are yaar, aisa recursion ni lgta mere se ;(

[glenfernandes]

I didn't like this one. You do not explain the approach here. You traverse all the possible BSTs, which is not the solution.

[piyush]

please show the solution approach in the solution section only-_-