Calculate all Unique Path count can be taken by Robot.

A robot is located at the top-left corner of a m x n grid ( 'Start' ).

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 ( 'Finish' ).

How many are possible unique paths there?

We will be using Dynamic Programming to solve this problem

public class UniquePathByRobot {

	public static void main(String[] args) {
		int m = 7, n = 3;
		System.out.println(CalculateUniquePaths(m,n));

	}

	private static int CalculateUniquePaths(int m, int n) {
		int[][] arr = new int[m][n];
		
		for(int i=0;i<m;i++)
			arr[i][0]=1;
		for(int i=0;i<n;i++)
			arr[0][i]=1;
		
		for(int i=1;i<m;i++)
		{
			for(int j=1;j<n;j++) {
				
					arr[i][j] = arr[i-1][j]+arr[i][j-1];
			}
			
		}
		return arr[m-1][n-1];
	}

}