Dsa
Recursion
Easy
Unique Paths on Grid
You're given a grid with dimensions m x n (1-indexed). Your task is to find the number of unique paths to reach the bottom-right corner, starting from the top-left corner. You can only move either down or right at any point in time. Write a program to read the dimensions from the input and output the total number of unique paths.
Example Input:
3 3
Example Output:
6
Key concepts
recursiondynamic programmingcombinatorial
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now