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

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 63. Unique Paths II

Count the number of distinct paths from the top-left to bottom-right of an m×n grid when you can only move right or down and cells marked 1 are impassable obstacles. This is a grid counting/DP problem with m,n ≤ 100 (answer ≤ 2×10^9).

Asked at:

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

Mid September, 2024

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 63. Unique Paths II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact