diff --git a/Unique Paths.cpp b/Unique Paths.cpp
new file mode 100644
index 0000000..7d2d083
--- /dev/null
+++ b/Unique Paths.cpp	
@@ -0,0 +1,18 @@
+/*
+There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot can only move either down or right at any point in time.
+
+Given the two integers m and n, return the number of possible unique paths that the robot can take to reach the bottom-right corner.
+
+The test cases are generated so that the answer will be less than or equal to 2 * 109.
+*/
+
+class Solution {
+public:
+    int dp[101][101]{};
+    int uniquePaths(int m, int n, int i = 0, int j = 0) {
+        if (i>=m || j>=n) return 0;
+        else if (i==m-1 && j==n-1) return 1;
+        if (dp[i][j]) return dp[i][j];
+        else return dp[i][j] = uniquePaths(m, n, i+1, j) + uniquePaths(m, n, i, j+1);
+    }
+};