2 051
Subscribers
No data24 hours
No data7 days
No data30 days
Posts Archive
Hi Vasu Welcome to this Community. Join Our Channel for daily Off-Campus Job Updates ❤️
👇👇
@offcampusjobs_0
@offcampusjobs_0
𝐘𝐨𝐮 𝐜𝐚𝐧 𝐦𝐚𝐤𝐞 𝐠𝐨𝐨𝐝 𝐦𝐨𝐧𝐞𝐲 𝐎𝐍𝐋𝐈𝐍𝐄 𝐭𝐫𝐮𝐞 𝐛𝐢𝐭𝐜𝐨𝐢𝐧 𝐢𝐧𝐯𝐞𝐬𝐭𝐞𝐝 𝐰𝐢𝐭𝐡 𝐚 𝐠𝐫𝐞𝐚𝐭 𝐩𝐥𝐚𝐭𝐞 𝐟𝐨𝐫𝐦 𝐰𝐞𝐫𝐞 𝐡𝐞/𝐬𝐡𝐞 𝐰𝐢𝐥𝐥 𝐥𝐞𝐝 𝐲𝐨𝐮 𝐨𝐧 𝐚 𝐥𝐢𝐭𝐭𝐥𝐞 𝐩𝐫𝐢𝐧𝐜𝐢𝐩𝐚𝐥𝐬 𝐭𝐨 𝐜𝐚𝐫𝐫𝐲 𝐢𝐟 𝐲𝐨𝐮 𝐚𝐛𝐥𝐞 𝐲𝐨𝐮𝐫 𝐦𝐚𝐧𝐚𝐠𝐞𝐫 𝐡𝐞/𝐬𝐡𝐞 𝐰𝐢𝐥𝐥 𝐦𝐚𝐤𝐞 𝐚𝐥𝐥 𝐩𝐨𝐬𝐬𝐢𝐛𝐥𝐞 𝐛𝐞𝐬𝐭 𝐭𝐨 𝐦𝐚𝐤𝐞 𝐲𝐨𝐮𝐫 𝐩𝐫𝐨𝐟𝐢𝐭, 𝐀 𝐠𝐨𝐨𝐝 𝐦𝐚𝐧𝐚𝐠𝐞𝐫 𝐢𝐬 𝐚 𝐠𝐨𝐨𝐝 𝐭𝐞𝐚𝐜𝐡𝐞𝐫, 𝐛𝐞𝐜𝐚𝐮𝐬𝐞 𝐡𝐞/𝐬𝐡𝐞 𝐢𝐬 𝐭𝐡𝐞 𝐨𝐧𝐞 𝐭𝐡𝐚𝐭 𝐭𝐚𝐤𝐞 𝐜𝐚𝐫𝐞 𝐨𝐟 𝐲𝐨𝐮𝐫 𝐭𝐫𝐚𝐝𝐞 𝐟𝐨𝐫 𝐭𝐡𝐨𝐬𝐞 𝐭𝐡𝐚𝐭 𝐚𝐫𝐞 𝐫𝐞𝐚𝐝𝐲 𝐭𝐨 𝐭𝐫𝐚𝐝𝐞 𝐜𝐨𝐧𝐭𝐚𝐜𝐭 𝐚 𝐠𝐨𝐨𝐝 𝐦𝐚𝐧𝐚𝐠𝐞𝐫 𝐟𝐨𝐫 𝐚 𝐬𝐭𝐚𝐫𝐭 𝐮𝐩 𝐜𝐚𝐩𝐢𝐭𝐚𝐥 @𝐓𝐫𝐚𝐝𝐞_𝐖𝐢𝐭𝐡_𝐀𝐮𝐬𝐭𝐢𝐧𝐬𝐩𝐞𝐧𝐜𝐞𝐫 𝐚𝐦 𝐧𝐨𝐭 𝐡𝐞𝐫𝐞 𝐭𝐨 𝐜𝐨𝐧𝐟𝐮𝐬𝐞 𝐧𝐨 𝐛𝐨𝐝𝐲 𝐣𝐮𝐬𝐭 𝐛𝐞𝐜𝐚𝐮𝐬𝐞 𝐨𝐟 𝐲𝐨𝐮𝐫 𝐨𝐰𝐧 𝐛𝐞𝐧𝐞𝐟𝐢𝐭𝐬 𝐬𝐨 𝐭𝐡𝐞 𝐞𝐚𝐫𝐥𝐢𝐞𝐫 𝐭𝐡𝐞 𝐛𝐞𝐭𝐭𝐞𝐫 𝐟𝐨𝐫 𝐲𝐨𝐮, 𝐚𝐥𝐥 𝐭𝐡𝐚𝐧𝐤𝐬 𝐭𝐨 𝐚 𝐠𝐫𝐞𝐚𝐭 𝐚𝐜𝐜𝐨𝐮𝐧𝐭 𝐦𝐚𝐧𝐚𝐠𝐞𝐫 @𝐓𝐫𝐚𝐝𝐞_𝐖𝐢𝐭𝐡_𝐀𝐮𝐬𝐭𝐢𝐧𝐬𝐩𝐞𝐧𝐜𝐞𝐫
👇👇👇👇👇👇👇👇👇👇👇
https://t.me/joinchat/gSXDQbNsHlkwOWQ0
Hi Nithya , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅
👇👇
@offcampusjobs_0
@offcampusjobs_0
Felicity Pelletier [
2089862277] is sending a spam message.
Action: Warn (1/3) ❕Hi Rudra , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅
👇👇
@offcampusjobs_0
@offcampusjobs_0
Hi Suraj Join Our Channel for daily Off-Campus Job Updates ❤️
👇👇
@offcampusjobs_0
@offcampusjobs_0
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
TCS IRA / Accenture Solution ❤️❤️
https://t.me/good_coders
https://t.me/good_coders
https://t.me/good_coders
