Medium

Quiz

#96 Unique Binary Search Trees

APPROACH

Given integer n, count and return the number of structurally unique BSTs that hold exactly n nodes with distinct values 1 through n.

Example 1:

Input: n = 3

Output: 5

Example 2:

Input: n = 1

Output: 1

1 of 4

1:00

What is the optimal approach for this problem?