dsa2 min read
Unique Binary Search Trees
Count the number of structurally unique BSTs with n nodes using Catalan numbers and DP.
Read →
Catalan
2 articles
dsa3 min read
Combinatorics: nCr, Pascal's Triangle, and Catalan Numbers
Compute combinations nCr efficiently with precomputed factorials, Pascal's triangle for small n, and Catalan numbers for tree/parenthesis counting.
Read →