Catalan numbers problem

#1


This is my submission for this problem the time complexity of above solution is o(n) which is fine but the ans of this problem overflow and made the ans wrong so what should I do in this question to make it right should I apply big integer class I already check with all the method recursive approach bottom up and top down but I am not able to pass the evaluation please suggest some changes and otherwise give a code for the reference

#2

@jaiskid
Use long long int instead of int.

#3

@tarunluthra Thanks tarun that was a silly mistake.

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.