Q: A robot is located at the top-left corner of a m x n grid. The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid. How many possible unique paths are there?
We can solve this problem using backtracking approach.
Other approach is using dynamic programming with memorization.
Posts
No comments:
Post a Comment