Minimal Path Sum

Suppose we have a m by n matrix filled with non-negative integers, find a path from top left corner to bottom right corner which minimizes the sum of all numbers along its path.

Note: Movements can only be either down or right at any point in time.

Example:

Input:

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

Output:

17

Explanation:

Because the path 1 → 3 → 1 → 1 → 1 minimizes the sum.

Try it yourself

Title

Script

Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book.

Contrary to popular belief, Lorem Ipsum is not simply random text.

1  >>> a = [1, 2, 3]
2  >>> a[-1]
3  3

Get premium for instant access to all content and solutions

Upgrade