NeetCode #714LC-64Medium2-D Dynamic ProgrammingNC 250
← Back to All Problems#714 · #64 · Minimum Path Sum(最小路径和)
📌 Problem Statement & Constraints
Given an
m x n grid of non-negative integers, find a path from the top-left to the bottom-right (moving right or down) that minimises the sum of the numbers along the path. Constraints: 1 <= m, n <= 200, 0 <= grid[i][j] <= 200.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!