How to calculate Catalan Number | Find Nth catalan number in most efficient ways (3 methods)

This video explains how to calculate catalan numbers by using 3 methods. The methods include recursive, dynamic programming and binomial coefficient.If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
PROOF of Time Complexity: stackoverflow....
CODE LINK: drive.google.c...

[@amarnath3660]

The simplicity of your explanation makes the videos very interesting. Superb explanation on Catalan number

[@techdose4u]

Thanks :)

[@mayankchauhan6680]

Cool Algo Buddy. I had solved problem 96 on leetcode by memoization but was wondering how to do it iteratively. And you nailed it

[@techdose4u]

👍🏼

[@ramatripathi8315]

all videos are very well compiled and explained. really impressed.

[@techdose4u]

Thanks 😊

[@tarungopal3065]

Superb Explanation Sir...Three Approaches are explained very clearly...

[@techdose4u]

Thanks

[@simple_user000]

Best video available on this topic..........

[@abhishekbanerjee6140]

In the DP solution algo, at the end it will be return c[n-1] since it is 0 based. Great video!

[@_ADITIKAJALE]

no its correct in the video

[@abhishekbanerjee6140]

@@_ADITIKAJALE oh ok. Thanks

[@silvahawk]

discrete math is so helpful in these situations, but I don't think I can remember 90% of what I learned from that class.... :(

[@ShivamSingh-it8te]

Crystal clear explanation! Maja aa gaya!😃😃👍

[@techdose4u]

Thanks :)

[@vivekyadav-zx1kw]

Today i just left a question in Publicis Sapient "Number of Binary Search Tree"based on catalan number..
Thanks for this video..

[@zaraahuja3144]

as always fantastic and clear explanation

[@techdose4u]

Thanks :)

[@dhanashreegodase4445]

watching 4th time actually😅..thanks

[@techdose4u]

Great ❤️ I think you have seen all my videos till date 😀

[@spetsnaz_2]

Great..!!!
Each step explained clearly

[@techdose4u]

Thanks :)

[@khushboorani2629]

triangular shape in space is minimized by square dynamic programming or it arrangement in space such that its row is the key of function of space management that is pascal's triangle.

[@CostaKazistov]

Explanation level 💯

[@techdose4u]

Thanks ☺️

[@salmanuddin8201]

Awesome Explanation !

[@kunalsoni7681]

Such a helpful explanation 😊 about Catalan ☺️☺️.. thank you sir ..

[@techykush7192]

thanks a lot bhaiya god bless u too 😍😍

[@techdose4u]

😊

[@dhanashreegodase4445]

watching 3rd time😅..thanks🤭

[@techdose4u]

🤭❤️

[@AmanKumar-ht8xi]

awesome explanation bro.. thank you

[@69upasonabiswas88]

such a helpful explanation.. Thanks a lot sir!

[@techdose4u]

Welcome

[@guddigupta4911]

Best explanation

[@AyushGupta-kp9xf]

please always keep up your work.. all the best to you and thanks a lot

[@techdose4u]

Welcome bro :) I will continue if I continue getting support :)

[@AyushGupta-kp9xf]

@@techdose4u full support to you always. 😊

[@kashifanwar9733]

clean and best explanation

[@techdose4u]

Thanks :)

[@amandwivedi1980]

Great Explanation sir

[@techdose4u]

Thanks ☺️

[@mandeep2192]

Very well explained...loved it

[@techdose4u]

Thanks :)

[@jagdishwarbiradar1763]

Your words at end of video's "feel free to ask" it's like " In desert someone ask me 'can you want water' "
Thinking of DP problems by recursive approach ,do I need think a tree diagram every time 😓 , or I have just formulate the equation and then call recursively by taking care of time complexity.

[@techdose4u]

Thinking about recursive solution is I think the easiest way to form a dp formula. It works for me.

[@jagdishwarbiradar1763]

@@techdose4u I mean, when you solving problems on Dp(problems based on recursive as we'll as tabular), your first step is made equation for the problem , and second step making the function for this problem by this equation and call it recursively, and taking care of base case , - IN this whole process did you think of tree diagram ? for entire recursive calls .

[@dhanashreegodase4445]

Thanks again.....🙃🙃

[@saravanan925]

remembering my higher school mathematical concept

[@yifuxero5408]

Here's the easiest way. Begin (1, 1,) dot (1, 1) = 2. Place the 2 on the right of (1, 1,) getting (1, 1, 2). Reverse and take the dot product of (1, 1, 2) and (2, 1, 1), getting (2 + 1 + 2) = 5. Then place the 5 to the right of 1, 1, 2, 5 and take the dot product of the reverse,(5, 2, 1, 1) getting (5 + 2 + 2 + 5) = 14. Put 14 to the right of the ongoing string getting (1, 1, 2, 5, 14) and take the dot product of the reverse, so dot product of (1, 1, 2, 5, 14) and (14, 5, 2, 1, 1) = (14 + 5 + 4 + 5 + 14) = 42., etc.

[@malkarajk4093]

Can u explain the implementation of cataln mumber using recursion sir

[@techdose4u]

I will try that too

[@malkarajk4093]

@@techdose4u thank u sir

[@TheSteak1984]

Thank you

[@techdose4u]

Welcome

[@bruteforceman2311]

You are doing great job 🥰

[@techdose4u]

Thanks :)

[@paragroy5359]

Nice explanation sir.....

[@techdose4u]

Thanks ;)

[@arpitsaini541]

great work sir

[@techdose4u]

Thanks

[@JamesHalpert8555]

understood the catalan number calculation but how to identify problems where this can be applied???

[@techdose4u]

Difficult to identify. You should either remeber Catalan number or remeber the problems where they are used. Otherwise if you see a series then confirm it on internet

[@JamesHalpert8555]

@@techdose4u thanks!!:)

[@sabujmahbubul5581]

Simply best

[@techdose4u]

Thanks

[@laraibanwar1618]

U r simply amazing

[@techdose4u]

Thanks

[@aditya_k_g]

there is direct formula for that is : Cn = [2*(2*n-1)*(Cn-1) ]/n+1

[@sahukarinaveenkumar3188]

If we give n=384 it is giving wrong output.. could u please check

[@gunabalang7034]

you are awesome man

[@techdose4u]

Thanks :)

[@devanshgoel3433]

thank u sir!

[@kunalsoni7681]

Sir can I use memorization for recursive approach 😊?.. I think it's stops again and again calculation 😊..

[@techdose4u]

Yes you can.

[@hemanthvardhinedi2307]

how catalan(n)=2ncn/(n+1)
could u plz tell what is mathematical intitution btwn them

[@mdlwlmdd2dwd30]

you can look wikipedia proof as author mentioned

[@shaamidrees6036]

Thanks

[@raghunandanreddy9324]

post more problems on dynamic programming

[@techdose4u]

Doing it bro :)

[@stonecoldcold2941]

U are awesome!

[@techdose4u]

Thanks :)

[@shubhamg02]

good video!!

[@techdose4u]

Thanks :)

[@shams_vai_360]

can I get your handnotes please will be very grateful towards you!!!

[@HimanshuSingh-ob9qo]

👍

[@techdose4u]

👍