Unique Paths

Try to solve the Unique Paths problem.

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 grid[m1][n1]grid[m-1][n-1] ...