Leetcode Triangle 120 || Code + Explanation + Examples || Dynamic Programming

Given a triangle array, return the minimum path sum from top to bottom.
For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either index i or index i + 1 on the next row.
Example 1:
Input: triangle = [[2],[3,4],[6,5,7],[4,1,8,3]]
Output: 11
Explanation: The triangle looks like:
2
3 4
6 5 7
4 1 8 3
The minimum path sum from top to bottom is 2 + 3 + 5 + 1 = 11 (underlined above).
Example 2:
Input: triangle = [[-10]]
Output: -10
LInk to challenge: leetcode.com/p...

[@madhuryadav2424]

Was trying to do this problem since morning finally got the right approach
Thanks.

[@kartikeyasaxena4826]

your solutions are pretty maam, no wonder i got them from this channel

[@reshmaparveen6679]

Tq ma'am my son continue watching ❤️❤️❤️

[@haltersweb]

Clearly presented. Helped me tremendously. Thanks!

[@saravanans9355]

Thanks 🎉🎉

[@ayushranjan5535]

amazing explanation

[@reshmaparveen6679]

Ma'am u r in IIT Bombay

[@ashokdurunde1814]

thank you for your explanation . I get little idea about dp

[@Bobby-mf6fw]

Great work mam 👍

[@ravikant1756]

thank you 🙏

[@ishikabaliyan41]

it will be dp[j] not dp[i] in last foor loop

[@RameshGaridapuri]

Grady approach wont satires all test cases , bettter go with dinamic programming

[@tanyagupta4247]

thanks for the explanation

[@mohdshahzad7371]

Thanks ma'am

[@suyashphatak9902]

Linkedin profile ?

[@062_yatinnagpal2]

Nice Explanation❤

[@pironobcoding]

nic soln thx

[@AmitKumar-hr3pc]

nice explanation.

[@subashpalanivel8476]

Wonderful ✨✨

[@maddycoder1294]

just wow

[@karthikmr1855]

thankyou mam for detailed explanation!!

[@vivekgupta6696]

today this videoo will have more comments than before , i am seeing 8 comments , 868 views lets see at the end of the day

[@ananyagoel512]

amazing explanation