[Java] Leetcode 96. Unique Binary Search Tree [DP Distinct Ways #9]

In this video, I'm going to show you how to solve [question title] which is related to DP Distinct Ways.

Here’s a quick rundown of what you’re about to learn:

⭐️ Course Contents ⭐️
⌨️ (0:00) Question
⌨️ (1:49) Solution Explain
⌨️ (7:44) Top Down Approach
⌨️ (11:18) Bottom Up Approach

In the end, you’ll have a really good understanding on how to solve [question title] and questions that are similar to this DP Distinct Ways.

[prajub]

thank you.. one of the best explanation this is for the problem.

[rishabh]

thanks! most solutions just show how to compute the catalan number like they've memorized it, however your explanation was great for building intuition.