Minimum Path Sum | Recursion | Bottom Up | Leetcode 64 | codestorywithMIK
This is the 16th Video on our Dynamic Programming (DP) Playlist.
In this video we will try to solve another very famous and good DP Problem "Minimum Path Sum" (Leetcode - 64)
We will solve it using Recursion + Memoization technique as well as Bottom UP DP.
We will do live coding after explanation and see if we are able to pass all the test cases.
Problem Name : Minimum Path Sum
Company Tags : Google, Ola, Goldman Sachs
My solutions on Github : https://github.com/MAZHARMIK/Intervie...
Leetcode Link : https://leetcode.com/problems/minimum...
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Intervie...
Subscribe to my channel : / @codestorywithmik
0:00 - Understanding Problem
2:12 - Khandani Approach (Recur + Memo)
11:19 - Story to Code (Recur + Memo)
17:43 - Bottom UP Story
29:59 - Story to Code (Bottom UP)
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish