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.
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 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 .
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
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.
The simplicity of your explanation makes the videos very interesting. Superb explanation on Catalan number
Thanks :)
Best video available on this topic..........
all videos are very well compiled and explained. really impressed.
Thanks 😊
Superb Explanation Sir...Three Approaches are explained very clearly...
Thanks
Cool Algo Buddy. I had solved problem 96 on leetcode by memoization but was wondering how to do it iteratively. And you nailed it
👍🏼
Crystal clear explanation! Maja aa gaya!😃😃👍
Thanks :)
discrete math is so helpful in these situations, but I don't think I can remember 90% of what I learned from that class.... :(
In the DP solution algo, at the end it will be return c[n-1] since it is 0 based. Great video!
no its correct in the video
@@_ADITIKAJALE oh ok. Thanks
Today i just left a question in Publicis Sapient "Number of Binary Search Tree"based on catalan number..
Thanks for this video..
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.
as always fantastic and clear explanation
Thanks :)
Explanation level 💯
Thanks ☺️
thanks a lot bhaiya god bless u too 😍😍
😊
Great..!!!
Each step explained clearly
Thanks :)
Such a helpful explanation 😊 about Catalan ☺️☺️.. thank you sir ..
Awesome Explanation !
Great Explanation sir
Thanks ☺️
watching 4th time actually😅..thanks
Great ❤️ I think you have seen all my videos till date 😀
please always keep up your work.. all the best to you and thanks a lot
Welcome bro :) I will continue if I continue getting support :)
@@techdose4u full support to you always. 😊
such a helpful explanation.. Thanks a lot sir!
Welcome
watching 3rd time😅..thanks🤭
🤭❤️
clean and best explanation
Thanks :)
awesome explanation bro.. thank you
Very well explained...loved it
Thanks :)
You are doing great job 🥰
Thanks :)
Can u explain the implementation of cataln mumber using recursion sir
I will try that too
@@techdose4u thank u sir
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.
Thinking about recursive solution is I think the easiest way to form a dp formula. It works for me.
@@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 .
Nice explanation sir.....
Thanks ;)
understood the catalan number calculation but how to identify problems where this can be applied???
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
@@techdose4u thanks!!:)
Best explanation
If we give n=384 it is giving wrong output.. could u please check
Thanks again.....🙃🙃
great work sir
Thanks
remembering my higher school mathematical concept
how catalan(n)=2ncn/(n+1)
could u plz tell what is mathematical intitution btwn them
you can look wikipedia proof as author mentioned
U r simply amazing
Thanks
Simply best
Thanks
you are awesome man
Thanks :)
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.
Sir can I use memorization for recursive approach 😊?.. I think it's stops again and again calculation 😊..
Yes you can.
there is direct formula for that is : Cn = [2*(2*n-1)*(Cn-1) ]/n+1
post more problems on dynamic programming
Doing it bro :)
Thank you
Welcome
good video!!
Thanks :)
thank u sir!
U are awesome!
Thanks :)
Thanks
Thanks.
welcome
can I get your handnotes please will be very grateful towards you!!!
👍
👍