Find the length of the longest superior substring in the given string?
If a string contains at least one character whose frequency is greater than or equal to the half of the length of the string, then the string is called superior.
import operator
n=int(input())
string=input()
max_length=0
prev_max_length=0
#To remove the blank space
string=string.replace(" ","")
for i in range(n-1):
sub_string=
d={}
if(prev_max_length==n):
break
if(prev_max_length>=len(string[i:])):
break;
for j in range(i,n):
sub_string.append(string[j])
if(string[j] in d):
d[string[j]]+=1
else:
d[string[j]]=1
max_alpha_set=max(d.items(),key=operator.itemgetter(1))
max_alpha=max_alpha_set[1]
len_substring=len(sub_string)
len_substring=len_substring//2
if(len_substring <= max_alpha):
max_length=len(sub_string)
if(prev_max_length<=max_length):
prev_max_length=max_length
print(prev_max_length)
python-3.x strings
New contributor
add a comment |
If a string contains at least one character whose frequency is greater than or equal to the half of the length of the string, then the string is called superior.
import operator
n=int(input())
string=input()
max_length=0
prev_max_length=0
#To remove the blank space
string=string.replace(" ","")
for i in range(n-1):
sub_string=
d={}
if(prev_max_length==n):
break
if(prev_max_length>=len(string[i:])):
break;
for j in range(i,n):
sub_string.append(string[j])
if(string[j] in d):
d[string[j]]+=1
else:
d[string[j]]=1
max_alpha_set=max(d.items(),key=operator.itemgetter(1))
max_alpha=max_alpha_set[1]
len_substring=len(sub_string)
len_substring=len_substring//2
if(len_substring <= max_alpha):
max_length=len(sub_string)
if(prev_max_length<=max_length):
prev_max_length=max_length
print(prev_max_length)
python-3.x strings
New contributor
Can you offer some more context, here? Is this homework? Does the code function? Do you have tests? What are you looking to improve in the code?
– Reinderien
just now
add a comment |
If a string contains at least one character whose frequency is greater than or equal to the half of the length of the string, then the string is called superior.
import operator
n=int(input())
string=input()
max_length=0
prev_max_length=0
#To remove the blank space
string=string.replace(" ","")
for i in range(n-1):
sub_string=
d={}
if(prev_max_length==n):
break
if(prev_max_length>=len(string[i:])):
break;
for j in range(i,n):
sub_string.append(string[j])
if(string[j] in d):
d[string[j]]+=1
else:
d[string[j]]=1
max_alpha_set=max(d.items(),key=operator.itemgetter(1))
max_alpha=max_alpha_set[1]
len_substring=len(sub_string)
len_substring=len_substring//2
if(len_substring <= max_alpha):
max_length=len(sub_string)
if(prev_max_length<=max_length):
prev_max_length=max_length
print(prev_max_length)
python-3.x strings
New contributor
If a string contains at least one character whose frequency is greater than or equal to the half of the length of the string, then the string is called superior.
import operator
n=int(input())
string=input()
max_length=0
prev_max_length=0
#To remove the blank space
string=string.replace(" ","")
for i in range(n-1):
sub_string=
d={}
if(prev_max_length==n):
break
if(prev_max_length>=len(string[i:])):
break;
for j in range(i,n):
sub_string.append(string[j])
if(string[j] in d):
d[string[j]]+=1
else:
d[string[j]]=1
max_alpha_set=max(d.items(),key=operator.itemgetter(1))
max_alpha=max_alpha_set[1]
len_substring=len(sub_string)
len_substring=len_substring//2
if(len_substring <= max_alpha):
max_length=len(sub_string)
if(prev_max_length<=max_length):
prev_max_length=max_length
print(prev_max_length)
python-3.x strings
python-3.x strings
New contributor
New contributor
edited 2 mins ago
Reinderien
2,684619
2,684619
New contributor
asked 5 mins ago
navneet arya
11
11
New contributor
New contributor
Can you offer some more context, here? Is this homework? Does the code function? Do you have tests? What are you looking to improve in the code?
– Reinderien
just now
add a comment |
Can you offer some more context, here? Is this homework? Does the code function? Do you have tests? What are you looking to improve in the code?
– Reinderien
just now
Can you offer some more context, here? Is this homework? Does the code function? Do you have tests? What are you looking to improve in the code?
– Reinderien
just now
Can you offer some more context, here? Is this homework? Does the code function? Do you have tests? What are you looking to improve in the code?
– Reinderien
just now
add a comment |
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
});
}
});
navneet arya 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%2f210335%2ffind-the-length-of-the-longest-superior-substring-in-the-given-string%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
navneet arya is a new contributor. Be nice, and check out our Code of Conduct.
navneet arya is a new contributor. Be nice, and check out our Code of Conduct.
navneet arya is a new contributor. Be nice, and check out our Code of Conduct.
navneet arya 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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f210335%2ffind-the-length-of-the-longest-superior-substring-in-the-given-string%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
Can you offer some more context, here? Is this homework? Does the code function? Do you have tests? What are you looking to improve in the code?
– Reinderien
just now