Implement a function to solve the Unique Paths problem (find the number of ways to move from the top-left corner to the bottom-right corner of an m x n grid)

Hard

Problem Statement

Sample Input

m = 3, n = 2

Sample Output

Limits

Time: 2s · Memory: 256 MB

Code Editor

00:00

import java.util.*; public class Main { public static int uniquePaths() { int m = 3, n = 2; // Your code here return 0; } }

Input

m = 3, n = 2

Expected Output

Custom Input (stdin)

Program Output

> Run your code to see console output.

Programming Exercises

Implement a function to solve the Unique Paths problem (find the number of ways to move from the top-left corner to the bottom-right corner of an m x n grid)

Problem Statement

Sample Input

Sample Output

Limits

Hint 1