This is a typical exam question that I need you to solve for me, you can find solutions online quite easily I just don't know how to translate them into my program. This is for a fixed price of $10, so make sure you bid is $10.
Imagine a robot sitting on the upper left hand corner of an NxN grid. The robot can only move in two directions: right and down.
We have some obstacles in the way and need to work out how many possible paths are there for the robot?
That is - paths from the top left square [0,0] to bottom right square [10,10]