Coding Solutions Group

Any company Non coding Genuine Assistance available lets help each other.

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

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

def Check_Vow(string, vowels): final = [each for each in string if each in vowels] print(len(final)) string=input() vowels = "AaEeIiOoUu" Check_Vow(string, vowels); Telegram - https://t.me/Coding_solution_0

/start

Yes

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

/startsendingpython

Okay

Anyone can help??

Photo from Sachin Selva😊

/start

Please give the answer of following

Photo from Rajesh

Any python developer here

Galat hai ye

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