Count Unique BSTs

Given an integer n, return the total number of unique binary search trees (BSTs) that can be formed using values from 1 to n. Each value can be used exactly once in the tree. Example Input: 3 Example Output: 5

Key concepts

binary_search_treecountingdynamic_programming

Practise this out loud — free

Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.

🎙 Practise this question now

Part of InterviewLab's verified interview question bank. We show the prompt and concepts to practise with — never a copy-paste solution.