Minimal Path Sum

Find the minimal path sum from the top left to the bottom right of a 2D grid by only moving right or down.

Medium1/4/2024

Problem statement

Given a 2D square grid of positive integers, write a function to find the minimal sum of a path from the top left corner to the bottom right corner. You can only move to the right or down. Input will be a 2D array of integers, and output should be the minimal sum.

For instance, given the following grid:

[
  [1, 3, 4],
  [1, 5, 2],
  [4, 4, 1],
]

The minimal path sum is 10 (1 -> 1 -> 5 -> 2 -> 1).

Problem leaderboard

#
Size
%
Users
#1
53 c.
Top 9%
lydxn
#2
82 c.
Top 18%
oskar
#3
86 c.
Top 36%
voytxt
Shanethegamer
#4
114 c.
Top 45%
Thomasdcrt
#5
115 c.
Top 55%
AlephSquirrel
#6
131 c.
Top 64%
mathis
#7
132 c.
Top 73%
scpchicken
#8
209 c.
Top 82%
val
#9
252 c.
Top 91%
maximec-indy
#10
276 c.
Top 100%
CorentinTh