Dsa
Dynamic Programming
Warm-up
Unique Paths in a Grid
You have a m x n grid and you want to find how many unique ways there are to go from the top-left corner to the bottom-right corner, moving only down or right.
Input format:
- Two integers m (rows) and n (columns).
Output format:
- A single integer representing 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