Time limit exceeded on HackerRank “Username Disparity”
0
$begingroup$
Here is the hackerrank question:
For two strings A and B, we define the similarity of the strings to be the length of the longest prefix common to both strings. For example, the similarity of strings "abc" and "abd" is 2, while the similarity of strings "aaa" and "aaab" is 3.
I am getting a timeout on some of the test cases but not all of them.
function usernameDisparity(inputs) {
return inputs.map(function (input) {
return getDisparity(input);
});
}
function getDisparity(input) {
var sum = 0;
for (var i = 0; i < input.length; i++) {
sum = sum + getSimilarity(i, input);
}
return sum;
}
function getSimilarity(index, input) {
var similarity = 0;
for (var i = 0; i < input.length; i++, index++) {
if (input[index] !== input[i]) {
return similarity;
} else {
similarity = similarity + 1;
}
}
return similarity;
}
javascript strings programming-challenge time-limit-exceeded
edited 5 mins ago
200_success
129k15153415
asked 14 hours ago
Zhen LiuZhen Liu
101
New contributor
Zhen Liu 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 |
0
$begingroup$
Here is the hackerrank question:
For two strings A and B, we define the similarity of the strings to be the length of the longest prefix common to both strings. For example, the similarity of strings "abc" and "abd" is 2, while the similarity of strings "aaa" and "aaab" is 3.
I am getting a timeout on some of the test cases but not all of them.
function usernameDisparity(inputs) {
return inputs.map(function (input) {
return getDisparity(input);
});
}
function getDisparity(input) {
var sum = 0;
for (var i = 0; i < input.length; i++) {
sum = sum + getSimilarity(i, input);
}
return sum;
}
function getSimilarity(index, input) {
var similarity = 0;
for (var i = 0; i < input.length; i++, index++) {
if (input[index] !== input[i]) {
return similarity;
} else {
similarity = similarity + 1;
}
}
return similarity;
}
javascript strings programming-challenge time-limit-exceeded
edited 5 mins ago
200_success
129k15153415
asked 14 hours ago
Zhen LiuZhen Liu
101
New contributor
Zhen Liu 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 |
0
0
0
$begingroup$
Here is the hackerrank question:
For two strings A and B, we define the similarity of the strings to be the length of the longest prefix common to both strings. For example, the similarity of strings "abc" and "abd" is 2, while the similarity of strings "aaa" and "aaab" is 3.
I am getting a timeout on some of the test cases but not all of them.
function usernameDisparity(inputs) {
return inputs.map(function (input) {
return getDisparity(input);
});
}
function getDisparity(input) {
var sum = 0;
for (var i = 0; i < input.length; i++) {
sum = sum + getSimilarity(i, input);
}
return sum;
}
function getSimilarity(index, input) {
var similarity = 0;
for (var i = 0; i < input.length; i++, index++) {
if (input[index] !== input[i]) {
return similarity;
} else {
similarity = similarity + 1;
}
}
return similarity;
}
javascript strings programming-challenge time-limit-exceeded
edited 5 mins ago
200_success
129k15153415
asked 14 hours ago
Zhen LiuZhen Liu
101
New contributor
Zhen Liu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
Here is the hackerrank question:
For two strings A and B, we define the similarity of the strings to be the length of the longest prefix common to both strings. For example, the similarity of strings "abc" and "abd" is 2, while the similarity of strings "aaa" and "aaab" is 3.
I am getting a timeout on some of the test cases but not all of them.
function usernameDisparity(inputs) {
return inputs.map(function (input) {
return getDisparity(input);
});
}
function getDisparity(input) {
var sum = 0;
for (var i = 0; i < input.length; i++) {
sum = sum + getSimilarity(i, input);
}
return sum;
}
function getSimilarity(index, input) {
var similarity = 0;
for (var i = 0; i < input.length; i++, index++) {
if (input[index] !== input[i]) {
return similarity;
} else {
similarity = similarity + 1;
}
}
return similarity;
}
javascript strings programming-challenge time-limit-exceeded
javascript strings programming-challenge time-limit-exceeded
edited 5 mins ago
200_success
129k15153415
asked 14 hours ago
Zhen LiuZhen Liu
101
New contributor
Zhen Liu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 5 mins ago
200_success
129k15153415
asked 14 hours ago
Zhen LiuZhen Liu
101
New contributor
Zhen Liu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 5 mins ago
200_success
129k15153415
edited 5 mins ago
200_success
129k15153415
edited 5 mins ago
200_success
129k15153415
129k15153415
asked 14 hours ago
Zhen LiuZhen Liu
101
New contributor
Zhen Liu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 14 hours ago
Zhen LiuZhen Liu
101
asked 14 hours ago
Zhen LiuZhen Liu
101
101
New contributor
Zhen Liu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Zhen Liu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Zhen Liu 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
});
}
});
Zhen Liu is a new contributor. Be nice, and check out our Code of Conduct.
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%2f212255%2ftime-limit-exceeded-on-hackerrank-username-disparity%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
Zhen Liu is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
Zhen Liu is a new contributor. Be nice, and check out our Code of Conduct.
Zhen Liu is a new contributor. Be nice, and check out our Code of Conduct.
Zhen Liu 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.
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%2f212255%2ftime-limit-exceeded-on-hackerrank-username-disparity%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
