91. Unique Paths

PRO

Medium

Topics

Companies

Hint

Understand Before Coding

Step 1 / 15

Speed: 1.0x

Unique Paths (Bottom-Up DP Grid)

Start

1

Target1

Current

Dependencies

Computed

Algorithm Commentary

Step 1 of 15

Current Action

Find unique paths from (0,0) to (2,4). Start calculations.

Variables

m3

n5

Loading visualization...

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: m = 3, n = 7

Output: 28

Example 2:

Input: m = 3, n = 2

Output: 3

Explanation: From the top-left corner, there are a total of 3 ways to reach the bottom-right corner: 1. Right -> Down -> Down 2. Down -> Down -> Right 3. Down -> Right -> Down

Constraints:

•

Time Complexity

O(m × n)

Space Complexity

O(m × n)

91. Unique Paths

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

91. Unique Paths

Understand Before Coding

Unique Paths (Bottom-Up DP Grid)

Current Action

Variables

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

Unique Paths (Bottom-Up DP Grid)

Current Action

Variables