en
Feedback

Don't get caught by a cheater! Telemetrio finds and tags such channels πŸ‘‰ If you want to see the tag, subscribe

Coding Solutions Group

Coding Solutions Group

Open in Telegram

Show more
IndiaThe category is not specified
2 051
Subscribers
No data24 hours
No data7 days
No data30 days
Posts Archive
Skip the interview?,πŸ˜‚πŸ˜‚

/startsendingpython

Answer please

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

Tomorrow tcs nqt help available ping me

Today my exam 1pm

Pls help me

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

Bro test cases not satisfilying did I want to do any extra

Can anyone help in capegimini exam tomorrow at 10 am

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