Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2912. Number of Ways to Reach Destination in the Grid
Count the number of distinct ways to go from the top-left to the bottom-right of a grid under given movement constraints (e.g., obstacles or variable step lengths per cell), returning the result modulo 1e9+7; the challenge is to handle large grids and exponential branching by using optimized DP/graph techniques (prefix sums, memoization, or DAG reasoning) to avoid naive O(n^3) work.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.