Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO
Open in Telegram
Main channel https://t.me/Coding_000 Contact Admin 👉 @ILOVEU_143 for booking your exam slots Web- https://coding000.github.io/Projects/ 💯% clearance in any placement exams OffCampus -https://t.me/Offcampus_000 Discussion- https://t.me/exams_discussion
Show more3 257
Subscribers
No data24 hours
-107 days
-3930 days
Posts Archive
Wiley Edge (9Lpa)
Help Available
Msg: @ILOVEU_143
Test Clearance Guaranteed ✅
Don't miss this opportunity 9Lpa Role
11 Jan 2023, 05:53
13 Jan 2023, ~10:31
🙄😩
10 Jan 2023, 22:46
11 Jan 2023, ~03:16
Can i create a instagram
10 Jan 2023, 22:08
11 Jan 2023, ~03:16
Any one want projects -mini or Major 😊 Unique project💥💥
Domain AI/ML
contact -@ILOVEU_143
Note -paid 🤑
share✅ share ✅@Coding_000
10 Jan 2023, 04:57
Everyone who is trying to reach @ILOVEU_143 please wait till tomorrow we will reply to everyone because of a lot of messages we are unable to reply to everyone.
@Coding_000 ✅
09 Jan 2023, 13:29
IDP L1 👇👇
https://t.me/exams_discussion
https://t.me/exams_discussion
IDP L2👇👇
https://t.me/coding000
https://t.me/coding000
Share and support ✅@Coding_000
07 Jan 2023, 21:09
In this channel i will share all 2023 batch offcampus job 🤘🤘
https://t.me/Offcampus_000
07 Jan 2023, 21:08
TCS HackQuest Round 1 ?
07 Jan 2023, 00:41
WILEY EDGE
Exam Help Available
Msg--> @ILOVEU_143
Note: It's Paid 💰💰
06 Jan 2023, 12:17
contact fast...💥 @iloveu_143
06 Jan 2023, 10:48
Send coding question..
https://t.me/exams_discussion
06 Jan 2023, 09:47
start at 8:15
06 Jan 2023, 09:41
Main channel https://t.me/Coding_000
OffCampus updates join -https://t.me/Offcampus_000
Discussion group join- https://t.me/coding000
Contact Admin 👉 @ILOVEU_143 for promotions or booking your exam slots
💯% clearance in any placement exams ✅
05 Jan 2023, 11:44
Legend 👍
05 Jan 2023, 11:30
Hey u superb man
05 Jan 2023, 11:29
Thanks a lot bro for u genunie help done all mcq sand coding ✅✅✅✅✨✨✨✨
05 Jan 2023, 11:28
Coding Q.1 100% correct 💯✅
class Solution {
public:
int isItPossilbe(string s) {
if(s.size()==1 or s.size()%2==1) return 0;
{
int i = s.size()/2;
string temp = s.substr(0,
if(count==s.size()/temp.size())I);
int count=0;
int index=0;
while((index=s.find(temp,index))!=string::npos)
{
c
return 1;
}
return 0;
}
};ount++;
index +=temp.size();
}
@Coding_000
05 Jan 2023, 11:07
Delloite answers:
Delloite codes avilable
Contact us Asap @iloveu_143
05 Jan 2023, 10:56
