Dynamic Programming Series #4: Unique Paths

Here is today's problem. Personally, I thought it was quite fun and just right in terms of difficulty. A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at ...