NeetCode #782LC-1871MediumGreedyNC 250
← Back to All Problems#782 · #1871 · Jump Game VII(跳跃游戏 VII)
📌 Problem Statement & Constraints
Given a 0-indexed binary string
s, and integers minJump and maxJump, you start at index 0 and may jump from i to j if s[j] == '0' and minJump <= j - i <= maxJump. Return whether you can reach n - 1. Constraints: 2 <= s.length <= 10^5, 0 <= minJump <= maxJump < s.length, s[0] == '0'.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!