ch
Feedback

不要被骗子欺骗!Telemetrio 会找到并标记这些频道 👉 如果想查看标记,请订阅

Coding Solutions Group

Coding Solutions Group

前往频道在 Telegram

显示更多
印度未指定类别
2 051
订阅者
无数据24 小时
无数据7 天
无数据30 天
帖子存档
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