Coding Solutions Group

Fast

Plzz

@sunnyburman10 [1032108770] is sending a spam message. Action: Warn (2/3) ❕

70% OFF

Hi N Welcome to this Community. Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @placement_0 @placement_0

Hi Vi$h@l , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0

Hi chaitu Welcome to this Community. Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @placement_0 @placement_0

Cpa python code available

/start

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 Girija Chowdary , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0

t= int(input ()) Max_g=0 g=0 For _ in range(t): E=int(input()) L=int(input ()) g+= E-L If g> max_g: max_g=g Print(max_g)

/startsendingpython

Hi Mithoon Welcome to this Community. Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @offcampusjobs_0 @offcampusjobs_0

Hi V@£ Welcome to this Community. Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @offcampusjobs_0 @offcampusjobs_0

Photo from Ashish Kumar