Dsa
Recursion
Medium
Unique Pathways
You are on a grid starting at the top-left corner (0,0) and need to reach the bottom-right corner (m-1,n-1). You can only move right or down. Given m and n, compute the number of unique pathways to reach the destination. Implement the function to read two integers from standard input and print the number of unique paths to standard output.
**Input Format:**
Two integers m and n separated by a space.
**Output Format:**
A single integer representing the number of unique paths.
**Example:**
Input:
3 7
Output:
28
Key concepts
recursiongrid traversalbacktracking
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