Скачать или смотреть 𝗧𝗿𝗶𝗮𝗻𝗴𝗹𝗲 - 𝗠𝗶𝗻𝗶𝗺𝘂𝗺 𝗣𝗮𝘁𝗵 𝗦𝘂𝗺 | 𝗩𝗶𝘀𝘂𝗮𝗹𝗶𝘇𝗮𝘁𝗶𝗼𝗻 | 𝗟𝗲𝗲𝘁𝗖𝗼𝗱𝗲 𝟭𝟮𝟬 | 𝗗𝘆𝗻𝗮𝗺𝗶𝗰𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 | 𝗣𝗵𝗮𝗻𝗶 𝗧𝗵𝗮𝘁𝗶𝗰𝗵𝗮𝗿𝗹𝗮

Finding minimum path sum for a given triangle using Dynamic Programming with Simple Visualization.

𝐋𝐞𝐞𝐭𝐜𝐨𝐝𝐞 𝐏𝐫𝐨𝐛𝐥𝐞𝐦 𝐋𝐢𝐧𝐤: https://leetcode.com/problems/triangle/

𝐓𝐢𝐦𝐞 𝐂𝐨𝐦𝐩𝐥𝐞𝐱𝐢𝐭𝐲 : 𝐎(𝐧^𝟐)
We are iterating through all numbers in the triangle, in first row we have 1 number, in second row we have 2 numbers, likewise in nth row, we ll have n numbers.
Sum to n numbers 1 + 2 + 3 + ... + n = n(n-1)/2, which gives us time complexity of O(n^2)

𝐒𝐩𝐚𝐜𝐞 𝐂𝐨𝐦𝐩𝐥𝐞𝐱𝐢𝐭𝐲: 𝐎(𝐧)
We are using a single list called dp whose length is equal to the size of the last row of the triangle.
Hence, space complexity is O(n)

𝐂𝐨𝐦𝐩𝐥𝐞𝐭𝐞 𝐏𝐥𝐚𝐲𝐥𝐢𝐬𝐭:
   • 𝐈𝐧𝐭𝐫𝐨𝐝𝐮𝐜𝐭𝐢𝐨𝐧 - 𝐏𝐡𝐚𝐧𝐢 𝐓𝐡𝐚𝐭𝐢𝐜𝐡𝐚𝐫𝐥𝐚  

𝐋𝐞𝐞𝐭𝐜𝐨𝐝𝐞 𝐇𝐚𝐫𝐝 𝐏𝐥𝐚𝐲𝐥𝐢𝐬𝐭
   • Leetcode Hard Playlist  

𝐂𝐨𝐧𝐧𝐞𝐜𝐭 𝐰𝐢𝐭𝐡 𝐦𝐞:
𝐋𝐢𝐧𝐤𝐞𝐝𝐈𝐧 -   / phanikiranthaticharla  
𝐅𝐚𝐜𝐞𝐛𝐨𝐨𝐤 -   / codingvideosbyphani  
𝐃𝐢𝐬𝐜𝐨𝐫𝐝 -   / discord