1289. Minimum Falling Path Sum II | DP | Greedy | Apple | Google | 5 Ways

In this video, I'll talk about how to solve Leetcode 1289. Minimum Falling Path Sum II | DP | Greedy | Apple | Google | 5 Ways
Minimum Falling Path Sum - • 931. Minimum Falling P...
Let's Connect:
📱Discord (Join Community) : / discord
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / ez.pz.dsa
💻 Twitter - / aryan_mittal007
🤖 Github: github.com/aryan-0077
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[@ARYANMITTAL]

Minimum Falling Path Sum - kzbin.info/www/bejne/oJ7QeIiaotSpgpo . Don't believe every Educator out there - kzbin.info/www/bejne/hnjUgH2iq5WJm7s

[@nikhilbabar2226]

That space optimization is god level insane !

[@apputadhiyal9451]

Thanks for video, I understood the greedy approach from discussion but couldn't implement it . Great explanation!

[@nikhilprakash729]

Great explanation

[@user-ti7jb6xp4n]

class Solution { public: int solve(int r,int c,vector& grid) { int n=grid.size(); if(n==1)return grid[0][0]; if(r==n)return 0; int ans=INT_MAX, curr_res=0; curr_res+=grid[r][c]; for(int j=0;j