Dsa
Recursion
Medium
Robot Path Count
A robot can only move down or right on an m x n grid. Write a function that returns the total number of unique paths from the top-left corner to the bottom-right corner. The size of the grid will be provided as two integers: m and n. The input format is as follows:
First line: Two integers m and n (1 <= m, n <= 10).
Example:
Input:
3 7
Output:
28
The unique paths are formed by moving either down or right from the start to the end.
Key concepts
recursiongrid traversal
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