O52
Unique Paths Matrix
Problem Statement & Objective
There is a robot on an m x n grid. The robot can only move down or right. How many unique paths are there from top-left to bottom-right?
Function Signature (Python)
unique_paths(m: int, n: int) -> intInput & Output Contract
Output Rule:Benzersiz yol sayısı (tam sayı).
System Constraints
1 <= m, n <= 100Example Execution Walkthrough
m = 3, n = 7 -> 28 yol
m = 3, n = 2 -> 3 yolExample Test Scenarios (3)
Example 1
Input:
[3,7]Expected Output:
28Example 2
Input:
[3,2]Expected Output:
3Example 3: 1x1
Input:
[1,1]Expected Output:
1