2 051
Підписники
Немає даних24 години
Немає даних7 днів
Немає даних30 днів
Архів дописів
Hi Ahamad Subscribe Our YouTube Channel 📣 for Daily Jobs Updates and Study Material 🔥
Hi Hemant Join Our Channel for daily Off-Campus Job Updates ❤️
👇👇
@offcampusjobs_0
@offcampusjobs_0
Hi William Join Our Channel for daily Off-Campus Job Updates ❤️
👇👇
@offcampusjobs_0
@offcampusjobs_0
Dk [
1026059901] has sent a 🔗 Link without authorization.
Action: Warn (1/3) ❕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
Hi Nani Join Our Channel for daily Off-Campus Job Updates ❤️
👇👇
@offcampusjobs_0
@offcampusjobs_0
Hi Lavanya Join Our Channel for daily Off-Campus Job Updates ❤️
👇👇
@offcampusjobs_0
@offcampusjobs_0
Hi Kickass :) , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅
👇👇
@offcampusjobs_0
@offcampusjobs_0
