Robot Path Finder

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. But certain cells are off limit such that the robot cannot step on them. Design an algorithm to find a path from the top left to the bottom right.

Latest Source Code:
Github: RobotPathFinder.java

Output:

 Path : [(0,0), (1,0), (2,0), (2,1), (2,2), (2,3), (3,3)]