Minimum Path Sum | Recursive | Dynamic Programming | Minimum cost Path

Published: 15 June 2020
on channel: Anurag Vishwa

1,873

Problem URL - https://leetcode.com/problems/minimum...
(Leetcode : 64 )
Solution : https://github.com/anuragvishwa/codin...
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.

On this page of the site you can watch the video online Minimum Path Sum | Recursive | Dynamic Programming | Minimum cost Path with a duration of hours minute second in good quality, which was uploaded by the user Anurag Vishwa 15 June 2020, share the link with friends and acquaintances, this video has already been watched 1,873 times on youtube and it was liked by 40 viewers. Enjoy your viewing!

13,912

323