Unique paths grid
A robot at the top-left of an m x n grid can only move right or down. Return the number of distinct paths to the bottom-right.
Implement
unique_paths(m: int, n: int) → intExamples
in
[3,7]out28What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[3,7]28not run yetsample