Problem URL - https://leetcode.com/problems/minimum-path-sum/
(Leetcode : 64 )
Solution : https://github.com/anuragvishwa/codingpractice/blob/master/min-path-sum.java
00:00- Description
02:13 - State Space Tree
02:54 - Recursive Approach
14:15 - Boundary Conditions
16:22 - Recursive Code
19:55 - Time Complexity Recursive
20:27 - Overlapping Subproblems
21:02 - Dynamic Programming Approach
26:33 - Dynamic Programming Code
Problem Statement -
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimises the sum of all numbers along its path.
Note: You can only move either down or right at any point in time.
Example:
Input:
[
[1,3,1],
[1,5,1],
[4,2,1]
]
Output: 7
Explanation: Because the path 1→3→1→1→1 minimises the sum.
