Too Long; Didn't Read
Dynamic Programming is a technique in computer programming that helps to efficiently solve a class of problems that have overlapping sub-problems and optimal substructure property. The problem asks for how many unique paths start from top-left of a grid to the bottom-right. The solution to this scenario is not Dynamic Programming. The approach we tried is not dynamic programming. It is the base of dynamic programming. The main factor of this algorithm is O(m*n) Complexity is the size of the full grid.