Unique Paths
2D/3D DP and Grids DSA practice problem on Onlearn.
Difficulty: medium.
Topics: Unique Paths in a Grid (Grid Unique Paths Problem), Dynamic Programming, Recursion, Memoization, Tabulation, Space Optimization, Grid Traversal, Matrices, Time Complexity, Space Complexity, matrix, dynamic programming, memoization, combinatorics, tabulation, space optimization, recursion, Combinatorics & Binomial Coefficients.
A robot is located at the top left corner of an m x n grid (marked 'Start'). The robot can only move either down or right at any point in time. The robot is trying to reach the bottom right corner of the grid (marked 'Finish'). How many possible unique paths are there? Input: The input will consist of two integers, m and n, representing the dimensions of the grid. Output: Return a single integer, the total number of unique paths from the top left to the bottom right corner. Example: Input: m = 3, n = 2 Output: 3 Explanation: For a 3x2 grid, there are 3 unique paths: 1. Right Down Down 2. Down Down Right 3. Down Right Down