HackerRank - Left Rotation in JavaScript
$begingroup$
I'm looking to learn more about data structures, time complexity, and efficient algorithms. I have solved the Left Rotation Problem
on HackerRank using JavaScript. I am looking to see ways to optimize the time complexity. I feel like I have a lot to learn, as don't grok Big O.
My solution:
function main() {
const nd = readLine().split(' ')
const numbers = parseInt(nd[0], 10)
const rotations = parseInt(nd[1], 10)
const arr = readLine().split(' ').map(aTemp => parseInt(aTemp, 10))
const front = arr.slice(0, rotations)
const back = arr.slice(rotations, numbers)
const new_arr = back.concat(front)
console.log(new_arr.join(' '))
}
I feel like this likely has bad time complexity, as under the hood, I believe the slice function uses a loop and has a time complexity of O(n), in addition, I'm unsure how JavaScript implements the merge from the concat method under the hood.
javascript performance
asked 20 mins ago
Justin BessJustin Bess
1
New contributor
Justin Bess is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I'm looking to learn more about data structures, time complexity, and efficient algorithms. I have solved the Left Rotation Problem
on HackerRank using JavaScript. I am looking to see ways to optimize the time complexity. I feel like I have a lot to learn, as don't grok Big O.
My solution:
function main() {
const nd = readLine().split(' ')
const numbers = parseInt(nd[0], 10)
const rotations = parseInt(nd[1], 10)
const arr = readLine().split(' ').map(aTemp => parseInt(aTemp, 10))
const front = arr.slice(0, rotations)
const back = arr.slice(rotations, numbers)
const new_arr = back.concat(front)
console.log(new_arr.join(' '))
}
I feel like this likely has bad time complexity, as under the hood, I believe the slice function uses a loop and has a time complexity of O(n), in addition, I'm unsure how JavaScript implements the merge from the concat method under the hood.
javascript performance
asked 20 mins ago
Justin BessJustin Bess
1
New contributor
Justin Bess is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I'm looking to learn more about data structures, time complexity, and efficient algorithms. I have solved the Left Rotation Problem
on HackerRank using JavaScript. I am looking to see ways to optimize the time complexity. I feel like I have a lot to learn, as don't grok Big O.
My solution:
function main() {
const nd = readLine().split(' ')
const numbers = parseInt(nd[0], 10)
const rotations = parseInt(nd[1], 10)
const arr = readLine().split(' ').map(aTemp => parseInt(aTemp, 10))
const front = arr.slice(0, rotations)
const back = arr.slice(rotations, numbers)
const new_arr = back.concat(front)
console.log(new_arr.join(' '))
}
I feel like this likely has bad time complexity, as under the hood, I believe the slice function uses a loop and has a time complexity of O(n), in addition, I'm unsure how JavaScript implements the merge from the concat method under the hood.
javascript performance
asked 20 mins ago
Justin BessJustin Bess
1
New contributor
Justin Bess is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
I'm looking to learn more about data structures, time complexity, and efficient algorithms. I have solved the Left Rotation Problem
on HackerRank using JavaScript. I am looking to see ways to optimize the time complexity. I feel like I have a lot to learn, as don't grok Big O.
My solution:
function main() {
const nd = readLine().split(' ')
const numbers = parseInt(nd[0], 10)
const rotations = parseInt(nd[1], 10)
const arr = readLine().split(' ').map(aTemp => parseInt(aTemp, 10))
const front = arr.slice(0, rotations)
const back = arr.slice(rotations, numbers)
const new_arr = back.concat(front)
console.log(new_arr.join(' '))
}
I feel like this likely has bad time complexity, as under the hood, I believe the slice function uses a loop and has a time complexity of O(n), in addition, I'm unsure how JavaScript implements the merge from the concat method under the hood.
javascript performance
javascript performance
asked 20 mins ago
Justin BessJustin Bess
1
New contributor
Justin Bess is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 20 mins ago
Justin BessJustin Bess
1
New contributor
Justin Bess is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 20 mins ago
Justin BessJustin Bess
1
New contributor
Justin Bess is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 20 mins ago
Justin BessJustin Bess
1
asked 20 mins ago
Justin BessJustin Bess
1
1
New contributor
Justin Bess is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Justin Bess is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Justin Bess is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
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
});
}
});
Justin Bess is a new contributor. Be nice, and check out our Code of Conduct.
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%2f211510%2fhackerrank-left-rotation-in-javascript%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
Justin Bess is a new contributor. Be nice, and check out our Code of Conduct.
Justin Bess is a new contributor. Be nice, and check out our Code of Conduct.
Justin Bess is a new contributor. Be nice, and check out our Code of Conduct.
Justin Bess is a new contributor. Be nice, and check out our Code of Conduct.
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.
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%2f211510%2fhackerrank-left-rotation-in-javascript%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
