Title: Day-17 q3: Jump Game · Issue #382 · SnowScriptWinterOfCode/LeetCode_Q · GitHub
Open Graph Title: Day-17 q3: Jump Game · Issue #382 · SnowScriptWinterOfCode/LeetCode_Q
X Title: Day-17 q3: Jump Game · Issue #382 · SnowScriptWinterOfCode/LeetCode_Q
Description: Jump Game You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Return true if you can reach the last index, or f...
Open Graph Description: Jump Game You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Return tr...
X Description: Jump Game You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Retur...
Opengraph URL: https://github.com/SnowScriptWinterOfCode/LeetCode_Q/issues/382
X: @github
Domain: github.com
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Day-17 q3: Jump Game","articleBody":"# Jump Game\r\n\r\nYou are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.\r\nReturn true if you can reach the last index, or false otherwise.\r\n\r\n### Example 1:\r\n\r\nInput: nums = [2,3,1,1,4]\r\nOutput: true\r\nExplanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.\r\n\r\n### Example 2:\r\n\r\nInput: nums = [3,2,1,0,4]\r\nOutput: false\r\nExplanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index. \r\n\r\n### Constraints:\r\n\r\n1 \u003c= nums.length \u003c= 104\r\n0 \u003c= nums[i] \u003c= 105","author":{"url":"https://github.com/div910","@type":"Person","name":"div910"},"datePublished":"2024-01-13T12:25:40Z","url":"https://github.com/SnowScriptWinterOfCode/LeetCode_Q/issues/382"}
| react-profiling | 0 |
| react-import-map | react,react-dom,react-dom/client,react-dom/profiling,react-is,react/compiler-runtime,react/jsx-dev-runtime,react/jsx-runtime,scheduler@b8488ee2c322 |
| route-pattern | /_view_fragments/issues/show/:user_id/:repository/:id/issue_layout(.:format) |
| route-controller | voltron_issues_fragments |
| route-action | issue_layout |
| fetch-nonce | v2:ea9ea152-17bd-a1bb-8671-14c03e0b2474 |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | 93AC:156D4E:7A5CBA:9ED4F9:6AFFCED5 |
| html-safe-nonce | 95298cc01d4c0de5e65c5cdf605bed4b46be87ea2250e706cc93d1a98b88b5cd |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI5M0FDOjE1NkQ0RTo3QTVDQkE6OUVENEY5OjZBRkZDRUQ1IiwidmlzaXRvcl9pZCI6IjM3OTI1MTg2Mjg4MjIyMDgyMTMiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ== |
| visitor-hmac | 5da8b7a7816dec126fedef07ea63d961b5f6ca92e5b8efaa8c6f6d4ffa61b468 |
| hovercard-subject-tag | issue:2080271110 |
| github-keyboard-shortcuts | repository,issues,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/_view_fragments/issues/show/SnowScriptWinterOfCode/LeetCode_Q/382/issue_layout |
| twitter:image | https://opengraph.githubassets.com/f419de5b2ceed1b5bb43a4b1f50732db59f36cede5347022e7d064c67be9fc74/SnowScriptWinterOfCode/LeetCode_Q/issues/382 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/f419de5b2ceed1b5bb43a4b1f50732db59f36cede5347022e7d064c67be9fc74/SnowScriptWinterOfCode/LeetCode_Q/issues/382 |
| og:image:alt | Jump Game You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Return tr... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | div910 |
| hostname | github.com |
| expected-hostname | github.com |
| None | 0a0d8686a27478df474dd7415776a7a080cde8838b3cd92ea7601187572e5729 |
| turbo-cache-control | no-preview |
| go-import | github.com/SnowScriptWinterOfCode/LeetCode_Q git https://github.com/SnowScriptWinterOfCode/LeetCode_Q.git |
| octolytics-dimension-user_id | 154897622 |
| octolytics-dimension-user_login | SnowScriptWinterOfCode |
| octolytics-dimension-repository_id | 735947375 |
| octolytics-dimension-repository_nwo | SnowScriptWinterOfCode/LeetCode_Q |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 735947375 |
| octolytics-dimension-repository_network_root_nwo | SnowScriptWinterOfCode/LeetCode_Q |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | 16a11879678aaf97e2a42c33ee70830aa084fa37 |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
| react-app-name | issues |
Links:
Viewport: width=device-width