Dsa
Recursion
Warm-up
Paths in a Grid
Given an m x n grid, count how many paths exist from the top-left to the bottom-right corner, only moving down or right. Use recursion for this problem.
Input Format:
- Two integers m and n (1 <= m, n <= 10).
Output Format:
- An integer representing the number of unique paths.
Example:
Input:
3 2
Output:
3
Key concepts
recursiongridscounting
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