Use when navigating a 2D grid with movement constraints.





🔹 Problem Types:



Unique Paths / Minimum Path Sum
Grid with Obstacles
Max Gold Collection
Longest Increasing Path
Robot Paths





🔹 Template (Bottom-Up):





int minPathSum(int[][] grid) {
int m = grid.length, n =...