Leetcode 62. Unique Paths

Count the number of distinct monotonic paths from the top-left to the bottom-right of an m×n grid when you may only move right or down. This is the classic lattice-path problem — the answer equals binomial coefficient C(m+n-2, m-1) (or can be computed with DP); m,n ≤ 100 and result ≤ 2·10^9.

Asked at:

Amazon

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late November, 2025

Oracle

Senior

Early November, 2025

Microsoft

Mid-level

Late May, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 62. Unique Paths

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact