Search
⌘K

Leetcode 2297. Jump Game VIII

Given a sequence and constrained jump rules (e.g., you may jump only within a distance range or according to element values, and some positions may be forbidden), determine whether you can reach the last index — the key challenge is efficiently tracking reachable indices using BFS/DP with sliding-window or prefix-sum optimizations.


Question Timeline

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

Comments

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