Challenge #12 Medium

Shortest Path in a Weighted Grid

Given a 2D grid where each cell contains a positive integer representing the cost to traverse that cell, find the path from the top-left corner to the bottom-right corner that minimizes the total cost. You can only move right or down at any point in time.

Constraints & Requirements

  • Grid dimensions: up to 1000 x 1000
  • Cell values: 1 to 1000
  • Return both the minimum cost and the path taken
  • Time complexity should be O(m*n) or better
  • Include test cases with your solution
Due: June 15, 2025 at 11:59 PM
0 Days
0 Hours
0 Mins
0 Secs

Problem Archive

Challenge #11: Binary Tree Level Order Traversal
Due: June 1, 2025
Completed
Challenge #10: Longest Palindromic Subsequence
Due: May 18, 2025
Completed
Challenge #9: Merge K Sorted Lists
Due: May 4, 2025
Completed
Challenge #8: Word Break Problem
Due: April 20, 2025
Completed
Challenge #7: Course Schedule (Topological Sort)
Due: April 6, 2025
Completed

Top Solvers

Rank Member Problems Solved Points
1 Alex C. 11 1,250
2 Sarah M. 10 1,100
3 David L. 9 980
4 Emma W. 8 850
5 James K. 7 720