Solo practice workspace

Interview Coder drill

Unique Paths

20:00

Medium

Given m and n, count how many ways a robot can move from the top-left to the bottom-right using only right and down moves. Print the count.

Example 1

Input: m = 3, n = 7

Output: 28

There are 28 right/down paths through the grid.

Constraints

1 <= m, n <= 100The answer fits in a 64-bit integer for these drills

Recall before you code

Capture your plan, then rate how clearly you recalled it before submitting.

What cues point to the Dynamic Programming 2D pattern?What invariant or template will you maintain?Which edge cases could break your approach?

How well did you recall the approach?

solution.py

Runs: 0 | Submissions: 0

Loading Python runtime...