diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/UniquePaths.java b/src/main/java/com/thealgorithms/dynamicprogramming/UniquePaths.java new file mode 100644 index 00000000..508227f0 --- /dev/null +++ b/src/main/java/com/thealgorithms/dynamicprogramming/UniquePaths.java @@ -0,0 +1,67 @@ +/** Author : Siddhant Swarup Mallick + * Github : https://github.com/siddhant2002 + */ + + +/** + * 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 any point in time. + * The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below). + * How many possible unique paths are there? + */ + +/** Program description - To find the number of unique paths possible */ + +package com.thealgorithms.dynamicprogramming; + +import java.util.*; + +public class UniquePaths { + public static boolean uniquePaths(int m , int n , int ans) { + int []dp = new int[n]; + Arrays.fill(dp,1); + for (int i=1; i