feat: minimum-path-sum challenge

Author: IbatoLionDev

2-NORMAL/Python/13-minimum-path-sum/proposed-solution/__pycache__/min_path_sum.cpython-312.pyc

@@ -0,0 +1,15 @@
+# Challenge: Given a matrix of integers, determine the minimum sum to reach from the top-left corner to the bottom-right corner, moving only right or down. Use dynamic programming to optimize the solution.
+
+from min_path_sum import min_path_sum
+
+def main():
+    grid = [
+        [1, 3, 1],
+        [1, 5, 1],
+        [4, 2, 1]
+    ]
+    result = min_path_sum(grid)
+    print(f"Minimum path sum: {result}")
+
+if __name__ == "__main__":
+    main()

2-NORMAL/Python/13-minimum-path-sum/proposed-solution/main.py

@@ -0,0 +1,20 @@
+def min_path_sum(grid):
+    if not grid or not grid[0]:
+        return 0
+
+    m, n = len(grid), len(grid[0])
+    dp = [[0] * n for _ in range(m)]
+
+    dp[0][0] = grid[0][0]
+
+    for i in range(1, m):
+        dp[i][0] = dp[i-1][0] + grid[i][0]
+
+    for j in range(1, n):
+        dp[0][j] = dp[0][j-1] + grid[0][j]
+
+    for i in range(1, m):
+        for j in range(1, n):
+            dp[i][j] = grid[i][j] + min(dp[i-1][j], dp[i][j-1])
+
+    return dp[m-1][n-1]