arrow_back Back to Challenges

#64 Minimum Path Sum

Medium Acceptance 0%
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

code_blocks
Coding
psychology
Aptitude