terminal
Elevo
/
ESC
Login
Initiate Registration
code
Topics
corporate_fare
Companies
history
History
arrow_back
Back to Challenges
#64
Minimum Path Sum
Medium
Acceptance 0%
Editorial
description
Problem Description
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.
checklist
Constraints
See problem description for detailed constraints.
science
Examples
Case #1
In:
# See problem description for input format
Out:
# Expected output
Mastery Tags
Arrays
Dynamic Programming
Matrix
Hiring Companies
Amazon
Oracle
code
Integrated IDE
Python 3
expand_more
C
C++ 17
Java
JavaScript
Python 3
C
C++ 17
Java
JavaScript
Python 3
refresh
class Solution: def minimumPathSum(self, *args): # Write your solution here pass
Login to Compile
Processing
terminal
Debug Output
home
Home
extension
Practice
robot_2
login
Sign In
account_circle
Menu
code_blocks
Coding
psychology
Aptitude
Navigation
close
Login
Registration