Minimum Falling Path Sum - (Google, Microsoft, Amazon, Flipkart, OLA…) : Explanation ➕ Live Coding

Channel:

codestorywithMIK

Subscribers:

92,300

Published on December 13, 2022 8:39:13 AM ● Video Link: https://www.youtube.com/watch?v=EQC0ckOyEGs

Duration: 48:56

699 views

42

This is the 8th Video on our Dynamic Programming (DP) Playlist.
In this video we will try to solve another very good, interesting and famous Problem "Minimum Falling Path Sum".

We will try to understand how we come up with the DP approach. The intuition behind it. And see time and space complexity.

We will do live coding after explanation and see if we are able to pass all the test cases.

Problem Name : Minimum Falling Path Sum
Company Tags : Google, Microsoft, Amazon, Flipkart, OLA, Goldman Sachs, MakeMyTrip, OYO Rooms, Samsung
My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Minimum%20Falling%20Path%20Sum.cpp
Leetcode Link : https://leetcode.com/problems/climbing-stairs/


My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/channel/UCaw58edcO3ZqMw76Bvs0kGQ



╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish