2 051
Suscriptores
Sin datos24 horas
Sin datos7 días
Sin datos30 días
Archivo de publicaciones
@Arjun143aa [
1061823590] is sending a spam message.
• Warns now: (3/3) ❕
• Action: Muted 🔇03 abr 2021, 09:39
You will be given a string S. You have to find two different sub-sequences of S such that
The two sub-sequences don't cross each other. In other words, all indices of
the first sub-sequence are strictly less than all indices of the second sub-
sequence.
• The length of the first sub-sequence multiplied by the the length of the second
subsequence is maximum possible.
• Both sub-sequences are palindromes
Given a string S, find the required two sub-sequences, and print the multiplication
value of their lengths.
Input Format
The first line contains a string, S, denoting the described string
Constraints
1 <= len(S) <= 3000
10 ene 2022, 00:34
Hi Sweety , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅
👇👇
@offcampusjobs_0
@offcampusjobs_0
02 abr 2021, 10:00
int c = 0;
for(int i = 0; str[i] != '\0'; i++) {
if(str[i] == ch)
c++;
}
return c;
count of specific character
Telegram - https://t.me/Coding_solution_0
07 dic 2021, 05:33
Hi Røçky , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅
👇👇
@offcampusjobs_0
@offcampusjobs_0
03 abr 2021, 01:22
