Leetcode 64. Minimum Path Sum

Given an m×n grid of non-negative numbers, find the minimum-sum path from the top-left to bottom-right when you may only move right or down. This is a classic grid dynamic-programming problem computing cumulative minimum sums (optimal O(mn) time).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 64. Minimum Path Sum

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact