tomatocream
1dec88aaf2
Add populate-notes.mjs that fetches problem descriptions and Python/C++ code stubs from LeetCode's GraphQL API. Populated all 197 NeetCode 150 note files with: - Problem description (examples, constraints) - Python code stub (function signature) - C++ code stub (function signature + includes) API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
1.3 KiB
1.3 KiB
TODO 1871. Jump Game VII medium
You are given a 0-indexed binary string s and two integers minJump and maxJump. In the beginning, you are standing at index 0, which is equal to '0'. You can move from index i to index j if the following conditions are fulfilled:
i + minJump <= j <= min(i + maxJump, s.length - 1), ands[j] == '0'.
Return true if you can reach index s.length - 1 in ~s~/, or false otherwise./
Example 1:
Input: s = "011010", minJump = 2, maxJump = 3
Output: true
Explanation:
In the first step, move from index 0 to index 3.
In the second step, move from index 3 to index 5.Example 2:
Input: s = "01101110", minJump = 2, maxJump = 3
Output: falseConstraints:
2 <= s.length <= 10^{5}s[i]is either'0'or'1'.s[0] == '0'1 <= minJump <= maxJump < s.length
TODO Approach
Write your approach here.
TODO Python
class Solution:
def canReach(self, s: str, minJump: int, maxJump: int) -> bool:TODO C++
class Solution {
public:
bool canReach(string s, int minJump, int maxJump) {
}
};