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

Поделиться
HTML-код
  • Опубликовано: 24 янв 2025

Комментарии • 93

  • @amarnath3660
    @amarnath3660 5 лет назад +19

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

  • @simple_user000
    @simple_user000 2 года назад +1

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

  • @ramatripathi8315
    @ramatripathi8315 3 года назад +5

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

  • @tarungopal3065
    @tarungopal3065 4 года назад +4

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

  • @mayankchauhan6680
    @mayankchauhan6680 3 года назад +7

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

  • @ShivamSingh-it8te
    @ShivamSingh-it8te 4 года назад +2

    Crystal clear explanation! Maja aa gaya!😃😃👍

  • @silvahawk
    @silvahawk 3 года назад +10

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

  • @abhishekbanerjee6140
    @abhishekbanerjee6140 3 года назад +2

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

  • @vivekyadav-zx1kw
    @vivekyadav-zx1kw 3 года назад

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

  • @khushboorani2629
    @khushboorani2629 2 года назад

    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.

  • @zaraahuja3144
    @zaraahuja3144 4 года назад +3

    as always fantastic and clear explanation

  • @CostaKazistov
    @CostaKazistov 3 года назад +1

    Explanation level 💯

  • @techykush7192
    @techykush7192 4 года назад +2

    thanks a lot bhaiya god bless u too 😍😍

  • @spetsnaz_2
    @spetsnaz_2 5 лет назад +2

    Great..!!!
    Each step explained clearly

  • @kunalsoni7681
    @kunalsoni7681 4 года назад

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

  • @salmanuddin8201
    @salmanuddin8201 Год назад

    Awesome Explanation !

  • @amandwivedi1980
    @amandwivedi1980 3 года назад +1

    Great Explanation sir

  • @dhanashreegodase4445
    @dhanashreegodase4445 3 года назад +1

    watching 4th time actually😅..thanks

    • @techdose4u
      @techdose4u  3 года назад +1

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

  • @AyushGupta-kp9xf
    @AyushGupta-kp9xf 4 года назад +1

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

    • @techdose4u
      @techdose4u  4 года назад +2

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

    • @AyushGupta-kp9xf
      @AyushGupta-kp9xf 4 года назад

      @@techdose4u full support to you always. 😊

  • @69upasonabiswas88
    @69upasonabiswas88 3 года назад +1

    such a helpful explanation.. Thanks a lot sir!

  • @dhanashreegodase4445
    @dhanashreegodase4445 3 года назад +1

    watching 3rd time😅..thanks🤭

  • @kashifanwar9733
    @kashifanwar9733 4 года назад +1

    clean and best explanation

  • @AmanKumar-ht8xi
    @AmanKumar-ht8xi 5 лет назад +2

    awesome explanation bro.. thank you

  • @mandeep2192
    @mandeep2192 4 года назад +1

    Very well explained...loved it

  • @bruteforceman2311
    @bruteforceman2311 4 года назад +1

    You are doing great job 🥰

  • @malkarajk4093
    @malkarajk4093 4 года назад +2

    Can u explain the implementation of cataln mumber using recursion sir

  • @jagdishwarbiradar1763
    @jagdishwarbiradar1763 4 года назад +3

    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
      @techdose4u  4 года назад +2

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

    • @jagdishwarbiradar1763
      @jagdishwarbiradar1763 4 года назад +1

      @@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 .

  • @paragroy5359
    @paragroy5359 4 года назад +1

    Nice explanation sir.....

  • @JamesHalpert8555
    @JamesHalpert8555 4 года назад +1

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

    • @techdose4u
      @techdose4u  4 года назад +1

      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
      @JamesHalpert8555 4 года назад

      @@techdose4u thanks!!:)

  • @guddigupta4911
    @guddigupta4911 Год назад

    Best explanation

  • @sahukarinaveenkumar3188
    @sahukarinaveenkumar3188 4 года назад

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

  • @dhanashreegodase4445
    @dhanashreegodase4445 3 года назад

    Thanks again.....🙃🙃

  • @arpitsaini541
    @arpitsaini541 4 года назад +1

    great work sir

  • @saravanan925
    @saravanan925 4 года назад +2

    remembering my higher school mathematical concept

  • @hemanthvardhinedi2307
    @hemanthvardhinedi2307 3 года назад

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

    • @mdlwlmdd2dwd30
      @mdlwlmdd2dwd30 3 года назад

      you can look wikipedia proof as author mentioned

  • @laraibanwar1618
    @laraibanwar1618 4 года назад +1

    U r simply amazing

  • @sabujmahbubul5581
    @sabujmahbubul5581 4 года назад +1

    Simply best

  • @gunabalang7034
    @gunabalang7034 4 года назад +1

    you are awesome man

  • @yifuxero5408
    @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.

  • @kunalsoni7681
    @kunalsoni7681 4 года назад +1

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

  • @aditya_k_g
    @aditya_k_g 7 месяцев назад

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

  • @raghunandanreddy9324
    @raghunandanreddy9324 5 лет назад +2

    post more problems on dynamic programming

  • @TheSteak1984
    @TheSteak1984 3 года назад +1

    Thank you

  • @shubhamg02
    @shubhamg02 4 года назад +1

    good video!!

  • @devanshgoel3433
    @devanshgoel3433 2 года назад

    thank u sir!

  • @stonecoldcold2941
    @stonecoldcold2941 4 года назад +1

    U are awesome!

  • @shaamidrees6036
    @shaamidrees6036 3 года назад

    Thanks

  • @Munisa-s9w
    @Munisa-s9w 4 месяца назад

    Thanks.

  • @shams_vai_360
    @shams_vai_360 7 месяцев назад

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

  • @HimanshuSingh-ob9qo
    @HimanshuSingh-ob9qo 4 года назад +1

    👍