LeetCode MEDIUM 62 Unique Paths Summary
Generated by Codex with GPT-5
Quick facts
- Difficulty:
MEDIUM - Problem: Unique Paths
- Main tags:
Math,Dynamic Programming,Combinatorics
What the problem is really asking
There is an m x n grid. A robot starts in the top-left corner and wants to reach the bottom-right corner. The robot can only move right or down.