Unique Paths
Try to solve the Unique Paths problem.
We'll cover the following
Statement
Imagine a scenario where an adventurous little robot, named Robi, has a mission to traverse a grid with m
rows and n
columns and reach a treasure box placed at
Given the two integers, m
 and n
, return the total number of unique paths that Robi can take from the grid's top-left corner to reach the bottom-right corner of the grid.
Constraints:
1Â
 m
,Ân
ÂÂ 100
Examples
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.