Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to DP: 2D

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›DP: 2D

Minimum Path Sum

intermediatelayer I8 · DP: 2D5 tests

Given a grid of non-negative numbers, find a path from the top-left to the bottom-right that minimises the sum of the numbers along it, and return that sum.

  • You may only move right or down
  • Both the start and the finish cells count towards the total
  • A greedy 'always step to the smaller neighbour' rule is not correct

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen