30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

Sign in / Sign up

Search

⌘K

Pricing Become a Coach

Search

⌘K

Get Premium

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

Meta

Microsoft

Question Timeline

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

Company

Level

Region

Early November, 2025

Microsoft

Mid-level

Late May, 2025

Meta

Senior

Mid March, 2025

Meta

Mid-level

Get Premium to View All 5 Reports

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