Dsa
Dynamic Programming
Warm-up
Unique Paths to Destination
You are given a grid of dimensions `m x n`. You start at the top-left corner of the grid and need to reach the bottom-right corner. You can only move either down or right. Write a function to calculate the number of unique paths to reach the bottom-right corner.
Input format:
- Two integers, `m` and `n` (1 <= m, n <= 100).
Output format:
- A single integer, the number of unique paths to reach the destination.
Example:
Input:
3 7
Output:
28
Key concepts
dynamic_programminggridpaths
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