Balanced Parentheses Count

Given an integer `n`, return the number of different valid parentheses combinations that can be made with `n` pairs of parentheses. The input format comprises a single integer. Output a single integer representing the number of valid combinations. Example: Input: 3 Output: 5

Key concepts

dynamic_programmingcombinatoricsdp

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 Praxari's verified interview question bank. We show the prompt and concepts to practise with — never a copy-paste solution.