Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Leetcode 403. Frog Jump
Given sorted stone positions and an initial jump of 1, determine whether a frog can reach the last stone when each jump length must be k-1, k, or k+1 from the previous jump. The core challenge is exploring reachable jump sizes per stone under position gaps — typically solved with dynamic programming/DFS using a map/set of stones to reachable jump lengths.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Mid November, 2022
Mid-level
Dynamic programming problem involving a game between Alice and Bob, similar to the frog jump problem but more complex. Required optimizing a recursive solution with memoization.
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.