FRESHWORKS SDE OA (2023 to 2024) | Route Planning in a Grid-Based Navigation System Problem | Dynamic Programming Solution

Q1. Grid Navigation Route Counter Problem Statement A delivery robot starts at the top-left corner of an m × n warehouse grid. The robot can only move: One cell to the right One cell downward Determine the total number of distinct routes the robot can take to reach the bottom-right corner. Return the total number of valid paths. Example Input m = 3 n = 7 Output 28 Explanation The robot starts at: (0, 0) and must reach: (m - ...