ch
Feedback

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

Coding Solutions Group

Coding Solutions Group

前往频道在 Telegram

显示更多
印度未指定类别
2 051
订阅者
无数据24 小时
无数据7 天
无数据30 天
帖子存档
Time out
09 5月 2021, 01:26

@Arjun143aa [1061823590] is sending a spam message. • Warns now: (3/3) ❕ • Action: Muted 🔇
03 4月 2021, 09:39

08 5月 2021, 23:43

07 5月 2021, 00:06

✋
03 4月 2021, 02:24

01 4月 2021, 23:15

Me too
03 4月 2021, 02:47

/startsendingpython
03 4月 2021, 03:26

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
10 1月 2022, 00:34

30 line code
26 2月 2022, 01:17

Hi Sweety , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0
02 4月 2021, 10:00

Virtusa coding help avilable msgg mee
21 6月 2022, 01:07

Useless group
03 4月 2021, 03:54

int c = 0; for(int i = 0; str[i] != '\0'; i++) { if(str[i] == ch) c++; } return c; count of specific character Telegram - https://t.me/Coding_solution_0
07 12月 2021, 05:33

Hi Røçky , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0
03 4月 2021, 01:22

/startsendingpython
03 4月 2021, 03:48

14 9月 2021, 00:46

Some help olz
03 4月 2021, 03:17

/startsendingpython
03 4月 2021, 03:25

Code pleade
18 9月 2021, 06:01