Dsa
Dynamic Programming
Warm-up
Unique Paths
You are given a grid with m rows and n columns. Your position starts at the top-left corner, and your goal is to reach the bottom-right corner by only moving down or right. Write a function that calculates the number of unique paths to reach the target.
Input Format:
- The first line contains two integers, m and n (1 <= m, n <= 100).
Output Format:
- A single integer representing the number of unique paths to the bottom-right corner.
Example:
Input:
3 3
Output:
2
Key concepts
dynamic_programmingcombinatorics
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