Exercises/#58 Unique Paths
#58

Unique Paths

Medium🧩 Dynamic Programming
70 XP

Problem

A robot is on an mΓ—n grid at top-left. It can only move right or down. How many unique paths to the bottom-right corner?

Examples

Input: m=3, n=7
Output: 28

Input: m=3, n=2
Output: 3
dynamic-programmingmath
AI Assistantβ€” powered by AI

Unlock hints progressively β€” start gentle, go deeper only if needed.

πŸ’‘

Level 1: Gentle Nudge

A subtle direction

πŸ—ΊοΈ

Level 2: Approach

The algorithm to use

πŸ”

Level 3: Detailed

Step-by-step guidance

58 / 150

Your Solution

⚑ JavaScript

to save progress and use AI features