Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Dynamic Programming: Suppose we have a m by n matrix filled with non-negative integers, find a pah from top left corner to bottom right corner which minimizes the sum of all numbers along its path in Python #1741

Open
akgmage opened this issue Oct 14, 2023 · 2 comments
Open

Dynamic Programming: Suppose we have a m by n matrix filled with non-negative integers, find a pah from top left corner to bottom right corner which minimizes the sum of all numbers along its path in Python #1741

akgmage opened this issue Oct 14, 2023 · 2 comments
Assignees
@JimNtantakas
Labels
Dynamic Programming Matrix

Comments

@akgmage
Copy link
Owner

akgmage commented Oct 14, 2023

Example:
Input:
[
[1,3,1],
[1,5,1],
[4,2,1]
]
Output:
7
Explanation:
Because the path 1 → 3 → 1 → 1 → 1 minimizes the sum.
@JimNtantakas
Copy link

I will try solving it!

@akgmage
Copy link
Owner Author

akgmage commented Jan 14, 2024

I will try solving it!

Sure

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@JimNtantakas JimNtantakas

Labels
Dynamic Programming Matrix
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@akgmage @JimNtantakas