Skip to content

DSA-Matrix-Python- Minimum Path sum #4796

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.

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

Closed
jen-sjen opened this issue Sep 30, 2021 · 5 comments · Fixed by #5882
Closed

DSA-Matrix-Python- Minimum Path sum #4796

jen-sjen opened this issue Sep 30, 2021 · 5 comments · Fixed by #5882

Comments

@jen-sjen
Copy link

Hey there, I'm participating in #hactoberfest2k21, Please assign me the issue. Good day!
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path.You can only move either down or right at any point in time.
Example:
Input: grid = [[1,3,1],[1,5,1],[4,2,1]]
Output: 7

@ABHIGPT401
Copy link

Please assign me this issue. I am a good programmer and a beginner at open source. I would give it my best!

@hackto-dev
Copy link

Please assign me this issue. I want to take my first steps towards contributing in open-source.

@CoderDaicho
Copy link

Hello please assigne me this issue.I am a beginner at open source and want to hone my skills.

Ydixit007 added a commit to Ydixit007/Python-1 that referenced this issue Oct 1, 2021
@Eureka-Viraj
Copy link

I can do this! please assign me this issue

@driptanil
Copy link

I can complete this Pythagoras Generator, Please assign this to me
I am new to opensource and I am willing to learn and contribute.

sakshi1717 added a commit to sakshi1717/Python that referenced this issue Oct 2, 2021
Fixes# TheAlgorithms#4796

This code implements a dynamic problem that is to find the minimum path sum.
sakshi1717 added a commit to sakshi1717/Python that referenced this issue Oct 2, 2021
Fixes#4796
SA-Matrix-Python- Minimum Path sum TheAlgorithms#4796

This code implements a dynamic program to find the minimum cost to reach the bottom rightmost corner of the grid.
It has been implemented with the best time & space complexity
@poyea poyea mentioned this issue May 25, 2022
14 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging a pull request may close this issue.

6 participants