Given an m×n grid filled with non-negative numbers, find the path from top-left to bottom-right that minimizes the sum. You can only move right or down.
Input: grid=[[1,3,1],[1,5,1],[4,2,1]] Output: 7 (1→3→1→1→1)
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features