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

[@ZenyxPlays061]

The way to explain dp questions i haven't seen anyone on whole youtube breaking the dp questions in that way really your channel helped me a lot understanding dp easily. Thanks a lot !

[@saivignesh03]

theory-->Great explanation sir feedback--> Explain code more clearly 🤗🤗

[@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 :)

[@rohitrawat4055]

Thanks Sir , itni video's baad isme samjh aaya ....

[@manojtate9604]

Your explanation was top-notch !

[@taffazzelhossain4530]

great explanation !!

[@mohammedilyas8824]

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

[@nikoo28]

Sure…i am adding new problems every week :)

[@MD_SAMEER___]

thank you so much man! you explained so well

[@vivekkumaryadav9862]

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

[@nikoo28]

that is so nice of you

[@saikiran1426]

Super explanation 😊

[@unemployedcse3514]

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

[@ssss22144]

Thank you annaa❤

[@ganeshpatel3985]

love the way you teach

[@AkashYadav-di6kd]

Thank you very much, bhaiya.

[@mdshariorhossainfarhan2819]

I was just curious and wanted to know if recursive approach would provide a better solution to this problem for bottom up approach

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

[@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?

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

[@vivekkumaryadav9862]

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

[@happyVibesOnly1618]

Brut force had better space complexity. public class TriangleMinPathSum { public int minimumTotal(List triangle) { return helper(triangle, 0, 0); } // Recursive helper method to find the minimum path sum private int helper(List triangle, int row, int col) { // Base case: if we reach the last row if (row == triangle.size() - 1) { return triangle.get(row).get(col); } // Recur to find the minimum path sum from the left and right children int leftPath = helper(triangle, row + 1, col); int rightPath = helper(triangle, row + 1, col + 1); // Current element + minimum of both paths return triangle.get(row).get(col) + Math.min(leftPath, rightPath); } }

[@Rocky-me7qh]

This problem is irritating