Added Solution for October 20.2025

[SjxSubham]

Implement a method to count unique BSTs for given elements.

Description

You must know about Catalan number to solve to question. In short,you may understand that Catalan number tells you how many BSTs can be formed for some given value n nodes. You must use all the nodes following BST property that is nodes with less value on left and nodes with right value on right.

Type of Change

• Question Added
• Solution Added
• Other (please specify):

Checklist

• I have performed a self-review of my code.
• I have commented my code, particularly in hard-to-understand areas.
• I have made corresponding changes to the documentation (if applicable).
• My changes generate no new warnings.
• I have added tests to cover my changes (if applicable).
• All new and existing tests pass.

Additional Notes

Please add any other information that is relevant to this pull request, including potential risks, alternative solutions considered, or future improvements.

[github-actions]

Great job, @SjxSubham! Thanks for creating the pull request.
Soon the maintainers/owner will review it and provide you with feedback/suggestions.
Make sure to star this awesome repository and follow the account!