I have triend this problem of coading.is my approach right? Please help me.

Question

1.00/5 (1 vote)

See more:

Given an arr, of size N and a string of site N the string is only consisting of x and y. You can select a substrtng with all equal characters and delete them and you will get the score i.e A[len] if len is the length of the substring deteted
Note: The array of scorA has 1 based indexing Find the max score than can be attained
Function Description
Complete the solve function in the editor below It has the following parameter(s)-

Parameters

N 'INTEGER
str STRING
arr 1 INTEGER ARRAY

Return The function must return an INTEGER denoting the max score

example:

Input
1

x

1024

output
1024

What I have tried:

Python

def cal(A,s):
       x=s.count('x');
       y=s.count('y');
       if(x>y):
             return max(A[0::x]);
       else:
             return max(A[0::y]);

n=int(input());
s=input();
A=list(map(int,input().split()));

Posted 21-Feb-21 23:49pm

BUBAI MONDAL

Updated 22-Feb-21 0:15am

KarstenK

v2

Add a Solution

Comments

Rick York 22-Feb-21 12:01pm

Why is this tagged for C? It has nothing to do with C.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Patrice T · Answer 1 · 2021-02-22T00:04:00

Your code is incomplete, but:

Python

def cal(A,s):
       x=s.count('x');
       y=s.count('y');
       if(x>y):
             return max(A[0::x]);
       else:
             return max(A[0::y]);

Here, you are counting all 'x' and all 'y' in the string, which is wrong.
Your requirement is:

Quote:
You can select a substring with all equal characters and delete them and you will get the score i.e A[len] if len is the length of the substring deteted

Example:

xyxyxxyyxxyyyyxyxyxyx
          ^^^^ this is the substring of maximum length with all equal chars

You have to search where is that substring.