Reach to the last index starting at index 0
0
$begingroup$
The task:
Given an integer list where each number represents the number of hops
you can make, determine whether you can reach to the last index
starting at index 0.
For example,
[2, 0, 1, 0]returnstruewhile[1, 1, 0, 1]returns
false.
My solutions:
// functional:
const reachLastIndexOf = (arr, start) => {
const next = start + arr[start];
if (start === next || next >= arr.length) return false;
if (next === arr.length -1) return true;
return reachLastIndexOf(arr, next);
}
console.log(reachLastIndexOf([2, 0, 1, 0], 0)
// imperative:
const reachLastIndexOf2 = arr => {
let start = 0;
while(start < arr.length) { // I'm tempted to write `while(true)` here
const next = start + arr[start];
if (start === next || next >= arr.length) return false;
if (next === arr.length - 1) return true;
start = next;
}
}
console.log(reachLastIndexOf2([1, 1, 0, 1]));
javascript functional-programming
asked 24 mins ago
thadeuszlaythadeuszlay
457213
$endgroup$
add a comment |
0
$begingroup$
The task:
Given an integer list where each number represents the number of hops
you can make, determine whether you can reach to the last index
starting at index 0.
For example,
[2, 0, 1, 0]returnstruewhile[1, 1, 0, 1]returns
false.
My solutions:
// functional:
const reachLastIndexOf = (arr, start) => {
const next = start + arr[start];
if (start === next || next >= arr.length) return false;
if (next === arr.length -1) return true;
return reachLastIndexOf(arr, next);
}
console.log(reachLastIndexOf([2, 0, 1, 0], 0)
// imperative:
const reachLastIndexOf2 = arr => {
let start = 0;
while(start < arr.length) { // I'm tempted to write `while(true)` here
const next = start + arr[start];
if (start === next || next >= arr.length) return false;
if (next === arr.length - 1) return true;
start = next;
}
}
console.log(reachLastIndexOf2([1, 1, 0, 1]));
javascript functional-programming
asked 24 mins ago
thadeuszlaythadeuszlay
457213
$endgroup$
add a comment |
0
0
0
$begingroup$
The task:
Given an integer list where each number represents the number of hops
you can make, determine whether you can reach to the last index
starting at index 0.
For example,
[2, 0, 1, 0]returnstruewhile[1, 1, 0, 1]returns
false.
My solutions:
// functional:
const reachLastIndexOf = (arr, start) => {
const next = start + arr[start];
if (start === next || next >= arr.length) return false;
if (next === arr.length -1) return true;
return reachLastIndexOf(arr, next);
}
console.log(reachLastIndexOf([2, 0, 1, 0], 0)
// imperative:
const reachLastIndexOf2 = arr => {
let start = 0;
while(start < arr.length) { // I'm tempted to write `while(true)` here
const next = start + arr[start];
if (start === next || next >= arr.length) return false;
if (next === arr.length - 1) return true;
start = next;
}
}
console.log(reachLastIndexOf2([1, 1, 0, 1]));
javascript functional-programming
asked 24 mins ago
thadeuszlaythadeuszlay
457213
$endgroup$
The task:
Given an integer list where each number represents the number of hops
you can make, determine whether you can reach to the last index
starting at index 0.
For example,
[2, 0, 1, 0]returnstruewhile[1, 1, 0, 1]returns
false.
My solutions:
// functional:
const reachLastIndexOf = (arr, start) => {
const next = start + arr[start];
if (start === next || next >= arr.length) return false;
if (next === arr.length -1) return true;
return reachLastIndexOf(arr, next);
}
console.log(reachLastIndexOf([2, 0, 1, 0], 0)
// imperative:
const reachLastIndexOf2 = arr => {
let start = 0;
while(start < arr.length) { // I'm tempted to write `while(true)` here
const next = start + arr[start];
if (start === next || next >= arr.length) return false;
if (next === arr.length - 1) return true;
start = next;
}
}
console.log(reachLastIndexOf2([1, 1, 0, 1]));
javascript functional-programming
javascript functional-programming
asked 24 mins ago
thadeuszlaythadeuszlay
457213
asked 24 mins ago
thadeuszlaythadeuszlay
457213
edited 12 mins ago
thadeuszlay
asked 24 mins ago
thadeuszlaythadeuszlay
457213
asked 24 mins ago
thadeuszlaythadeuszlay
457213
asked 24 mins ago
thadeuszlaythadeuszlay
457213
457213
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f213278%2freach-to-the-last-index-starting-at-index-0%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f213278%2freach-to-the-last-index-starting-at-index-0%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
