Triangle (LeetCode 120) | Easy tutorial | Bottom-up Top-down dynamic programming | StudyAlgorithms

[@andrejiskra3391]

I think you structured your video very very well and explained the concepts and solutions perfectly. Timestamps were also very helpful. Thank you for creating this.

[@nikoo28]

glad you feel that way

[@kunalkheeva]

Appreciate your work! Most underrated channel though! Keep posting.

[@nikoo28]

fingers crossed :)

[@manojtate9604]

Your explanation was top-notch !

[@mohammedilyas8824]

Great explanation sir,pls bring on some most tricky interview questions frequently asked

[@nikoo28]

Sure…i am adding new problems every week :)

[@032_RishavDey]

Sir we can optimise the Space Complexity to O(N)

[@nikoo28]

what will your approach be?

[@032_RishavDey]

@@nikoo28 just have one dp array of size equal to N, and initialise it with values in last row. Then perform bottom up approach. So our answer is in dp of 0.

[@nikoo28]

@@032_RishavDey that is indeed smart.. 😄

[@saikiran1426]

How

[@unemployedcse3514]

one vedio explains gist of dynamic programming and other concepts , thank you 😍

[@saikiran1426]

Super explanation 😊

[@vivekkumaryadav9862]

the way that u explain with example it help a lot to understand
thanks sir

[@nikoo28]

that is so nice of you

[@leetcodebaby6680]

When you were explaining the problem, you left explaining after 2 rows when things really started becoming tricky. You left at the point when it was most needed.

[@nikoo28]

I discuss 2 approaches in the solution, a top-down and a bottom-up approach. Does that help?
Can you tell me the timestamp at which you struggled? I can help more.

[@ganeshpatel3985]

love the way you teach

[@alirezaaramoun615]

I would like to know how the top-bottom approach can be applied. I attempted to apply it but ran into difficulties. Could someone please assist me?

[@AkashYadav-di6kd]

Thank you very much, bhaiya.

[@vivekkumaryadav9862]

TC -> O(n^2)
S.C -> O(n^2)