Mixing
How can I solve this problem with the help of dynamic programming?
$begingroup$
I am preparing for a national algorithmic competition and I have encountered this question,
You are given a string that contains only lowercase English letters. In one step, you can choose an index from the string and assign the next letter in the alphabet (a->b,b->c,...z->a) to that index. Lets define f(s) as the number of indices in the string,where , s[i]!=s[i+1]
You are given a number k. Now, your task is to determine the minimum number of steps required to perform on the string to obtain a new string such that
f(new-string)<=k
Print the minimum number of steps.
Example:-
string: abcz
k=1
Output: 3
Explaination:-New string will be (one of the possibilities)cccz and f(new-string)=1
Any dp/non-dp approach to solve this problem? Thanks :-)
programming
asked Jan 23 at 18:22
Karan GujarKaran Gujar
63
$endgroup$
add a comment |
$begingroup$
I am preparing for a national algorithmic competition and I have encountered this question,
You are given a string that contains only lowercase English letters. In one step, you can choose an index from the string and assign the next letter in the alphabet (a->b,b->c,...z->a) to that index. Lets define f(s) as the number of indices in the string,where , s[i]!=s[i+1]
You are given a number k. Now, your task is to determine the minimum number of steps required to perform on the string to obtain a new string such that
f(new-string)<=k
Print the minimum number of steps.
Example:-
string: abcz
k=1
Output: 3
Explaination:-New string will be (one of the possibilities)cccz and f(new-string)=1
Any dp/non-dp approach to solve this problem? Thanks :-)
programming
asked Jan 23 at 18:22
Karan GujarKaran Gujar
63
$endgroup$
add a comment |
$begingroup$
I am preparing for a national algorithmic competition and I have encountered this question,
You are given a string that contains only lowercase English letters. In one step, you can choose an index from the string and assign the next letter in the alphabet (a->b,b->c,...z->a) to that index. Lets define f(s) as the number of indices in the string,where , s[i]!=s[i+1]
You are given a number k. Now, your task is to determine the minimum number of steps required to perform on the string to obtain a new string such that
f(new-string)<=k
Print the minimum number of steps.
Example:-
string: abcz
k=1
Output: 3
Explaination:-New string will be (one of the possibilities)cccz and f(new-string)=1
Any dp/non-dp approach to solve this problem? Thanks :-)
programming
asked Jan 23 at 18:22
Karan GujarKaran Gujar
63
$endgroup$
I am preparing for a national algorithmic competition and I have encountered this question,
You are given a string that contains only lowercase English letters. In one step, you can choose an index from the string and assign the next letter in the alphabet (a->b,b->c,...z->a) to that index. Lets define f(s) as the number of indices in the string,where , s[i]!=s[i+1]
You are given a number k. Now, your task is to determine the minimum number of steps required to perform on the string to obtain a new string such that
f(new-string)<=k
Print the minimum number of steps.
Example:-
string: abcz
k=1
Output: 3
Explaination:-New string will be (one of the possibilities)cccz and f(new-string)=1
Any dp/non-dp approach to solve this problem? Thanks :-)
programming
programming
asked Jan 23 at 18:22
Karan GujarKaran Gujar
63
asked Jan 23 at 18:22
Karan GujarKaran Gujar
63
asked Jan 23 at 18:22
Karan GujarKaran Gujar
63
asked Jan 23 at 18:22
Karan GujarKaran Gujar
63
asked Jan 23 at 18:22
Karan GujarKaran Gujar
63
63
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.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
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: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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
},
noCode: 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%2fmath.stackexchange.com%2fquestions%2f3084863%2fhow-can-i-solve-this-problem-with-the-help-of-dynamic-programming%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 Mathematics 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%2fmath.stackexchange.com%2fquestions%2f3084863%2fhow-can-i-solve-this-problem-with-the-help-of-dynamic-programming%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
