اکنون در دسترس! پژوهش تلگرام ۲۰۲۵ — مهمترین بینشهای سال 
Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO
رفتن به کانال در 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
نمایش بیشتر3 360
مشترکین
اطلاعاتی وجود ندارد24 ساعت
-67 روز
-3930 روز
آرشیو پست ها
Hy guys
Small suggestion for 2023 batch guys ❤️
*Those who are 2023 batch passouts, our suggestion is try to get job by completing your final year.
*Once you came out from your college, you don't get even exam links also.
*we can't expect mass hiring compare to present situation.
*Once ask your seniors 2021 and 2022 batch guys. They haven't received even exam links also from past 5 to 6 months.
Please take your current placement exams seriously.
@ILOVEU_143✅
Any one want projects -mini or Major 😊 Unique project💥💥
Domain AI/ML
contact -@ILOVEU_143
Note -paid 🤑
share✅ share ✅@Coding_000
Amazon sde,IBM, wiley edge, Amcat or Any placements examm help available...
Contact @ILOVEU_143 ✅
Test Clearance Guaranteed ✅
PLAGRISM FREE CODES
Don't miss this opportunity🥹
Team #Love143 @Coding_000
Word shorter removing duplicates
Completed..all test cases pass..✅
https://t.me/exams_discussion
👇👇
IBM share ur questions here...
who are having IBM at 6pm
Login at 6:06pm✅
Dm for Code @ILOVEU_143
string changeCase(string s, int n)
{
int n = s.size();
string ans = "";
if (n == 1)
{
for (int i = 0; i < n; i++)
{
int a = 0;
if (s[i] == ' ')
a = 1;
else if (a == 1)
ans += toupper(s[i]);
else
ans += s[i];
}
}
else if (n == 2)
{
for (int i = 0; i < n; i++)
{
int a = 0;
if (s[i] == ' ')
ans += '-';
else
ans += s[i];
}
}
else if (n == 3)
{
for (int i = 0; i < n; i++)
{
int a = 0;
if (s[i] == ' ')
ans += '_';
else
ans += s[i];
}
}
else if (n == 4)
{
ans += toupper(s[0]);
for (int i = 1; i < n; i++)
{
int a = 0;
if (s[i] == ' ')
a = 1;
else if (a == 1)
ans += toupper(s[i]);
else
ans += s[i];
}
}
return ans;
}
C++✅
string changeCase(string s, int n)
{
int n = s.size();
string ans = "";
if (n == 1)
{
for (int i = 0; i < n; i++)
{
int a = 0;
if (s[i] == ' ')
{
a = 1;
}
else if (a == 1)
{
ans += toupper(s[i]);
}
else
{
ans += s[i];
}
}
}
else if (n == 2)
{
for (int i = 0; i < n; i++)
{
int a = 0;
if (s[i] == ' ')
{
ans += '-';
}
else
{
ans += s[i];
}
}
}
}
Longest prime elements IBM CODE ✅
