Hackerrank Beautiful Strings
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ margin-bottom:0;
}
$begingroup$
Problem Statement
You are given a string, S , consisting of lowercase English letters.
A string is beautiful with respect S to if it can be derived from S by removing exactly 2 characters.
Find and print the number of different strings that are beautiful with respect to S.
Input Format
A single string of lowercase English letters denoting S.
Output Format
Print the number of different strings that are beautiful with respect
to S.
Sample Input
abba
Sample Output
4
Explanation
The following strings can be derived by removing characters from S:
ab, bb, ba, ab, ba, aa and bb.
This gives us our set of unique beautiful strings,
B = {ab, ba, aa,as
bb}|B| = 4, we print 4
Here is my solution but it's not using dynamic programming. I am not getting any hints about how it can be solved via a DP approach.
function beautifulStrings(str) {
const res = new Set()
for (let i = 0; i < str.length - 1; i++) {
for (let j = i + 1; j < str.length; j++) {
let s = str.split('')
s[i] = undefined
s[j] = undefined
res.add(s.join(''))
}
}
return res.size
}
javascript programming-challenge dynamic-programming
edited 6 hours ago
Alex
1,333419
asked 6 hours ago
Rajat SaxenaRajat Saxena
1485
$endgroup$
add a comment |
$begingroup$
Problem Statement
You are given a string, S , consisting of lowercase English letters.
A string is beautiful with respect S to if it can be derived from S by removing exactly 2 characters.
Find and print the number of different strings that are beautiful with respect to S.
Input Format
A single string of lowercase English letters denoting S.
Output Format
Print the number of different strings that are beautiful with respect
to S.
Sample Input
abba
Sample Output
4
Explanation
The following strings can be derived by removing characters from S:
ab, bb, ba, ab, ba, aa and bb.
This gives us our set of unique beautiful strings,
B = {ab, ba, aa,as
bb}|B| = 4, we print 4
Here is my solution but it's not using dynamic programming. I am not getting any hints about how it can be solved via a DP approach.
function beautifulStrings(str) {
const res = new Set()
for (let i = 0; i < str.length - 1; i++) {
for (let j = i + 1; j < str.length; j++) {
let s = str.split('')
s[i] = undefined
s[j] = undefined
res.add(s.join(''))
}
}
return res.size
}
javascript programming-challenge dynamic-programming
edited 6 hours ago
Alex
1,333419
asked 6 hours ago
Rajat SaxenaRajat Saxena
1485
$endgroup$
add a comment |
$begingroup$
Problem Statement
You are given a string, S , consisting of lowercase English letters.
A string is beautiful with respect S to if it can be derived from S by removing exactly 2 characters.
Find and print the number of different strings that are beautiful with respect to S.
Input Format
A single string of lowercase English letters denoting S.
Output Format
Print the number of different strings that are beautiful with respect
to S.
Sample Input
abba
Sample Output
4
Explanation
The following strings can be derived by removing characters from S:
ab, bb, ba, ab, ba, aa and bb.
This gives us our set of unique beautiful strings,
B = {ab, ba, aa,as
bb}|B| = 4, we print 4
Here is my solution but it's not using dynamic programming. I am not getting any hints about how it can be solved via a DP approach.
function beautifulStrings(str) {
const res = new Set()
for (let i = 0; i < str.length - 1; i++) {
for (let j = i + 1; j < str.length; j++) {
let s = str.split('')
s[i] = undefined
s[j] = undefined
res.add(s.join(''))
}
}
return res.size
}
javascript programming-challenge dynamic-programming
edited 6 hours ago
Alex
1,333419
asked 6 hours ago
Rajat SaxenaRajat Saxena
1485
$endgroup$
Problem Statement
You are given a string, S , consisting of lowercase English letters.
A string is beautiful with respect S to if it can be derived from S by removing exactly 2 characters.
Find and print the number of different strings that are beautiful with respect to S.
Input Format
A single string of lowercase English letters denoting S.
Output Format
Print the number of different strings that are beautiful with respect
to S.
Sample Input
abba
Sample Output
4
Explanation
The following strings can be derived by removing characters from S:
ab, bb, ba, ab, ba, aa and bb.
This gives us our set of unique beautiful strings,
B = {ab, ba, aa,as
bb}|B| = 4, we print 4
Here is my solution but it's not using dynamic programming. I am not getting any hints about how it can be solved via a DP approach.
function beautifulStrings(str) {
const res = new Set()
for (let i = 0; i < str.length - 1; i++) {
for (let j = i + 1; j < str.length; j++) {
let s = str.split('')
s[i] = undefined
s[j] = undefined
res.add(s.join(''))
}
}
return res.size
}
javascript programming-challenge dynamic-programming
javascript programming-challenge dynamic-programming
edited 6 hours ago
Alex
1,333419
asked 6 hours ago
Rajat SaxenaRajat Saxena
1485
edited 6 hours ago
Alex
1,333419
asked 6 hours ago
Rajat SaxenaRajat Saxena
1485
edited 6 hours ago
Alex
1,333419
edited 6 hours ago
Alex
1,333419
edited 6 hours ago
Alex
1,333419
1,333419
asked 6 hours ago
Rajat SaxenaRajat Saxena
1485
asked 6 hours ago
Rajat SaxenaRajat Saxena
1485
asked 6 hours ago
Rajat SaxenaRajat Saxena
1485
1485
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
});
}
});
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%2f217102%2fhackerrank-beautiful-strings%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
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%2f217102%2fhackerrank-beautiful-strings%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
