Dsa
Dynamic Programming
Easy
Unique Paths in Grid
You are at the top-left corner of an m x n grid and you can only move down or right. Write a program to find the number of unique paths to reach the bottom-right corner from the top-left corner. The first line of input contains two integers m and n (1 <= m, n <= 100). Output the number of unique paths.
Example:
Input:
3 2
Output:
3
Key concepts
dynamic_programminggridcombinatorics
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