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 341
مشترکین
اطلاعاتی وجود ندارد24 ساعت
-167 روز
-5330 روز
آرشیو پست ها
CAPGEMINI, WILEY EDGE & QUALITLABS EXAM SOLUTION GROUP:
@Coding_000
join the discussion group for sending questions
https://t.me/+TF1M5QbSkTEwNjA1
https://t.me/+TF1M5QbSkTEwNjA1
✅ Share post in ur college Whatsapp grps.
EY ,MINDTREE ,Virtusa exam help available
Contact:
@ILOVEU_000
For slot booking🤘
Note: it's paid help
Goldman Sachs Internship Drive 2022 | New Analyst Program | Fresher Job | Graduate Job 2022 & 2023
Job Role : New Analyst Program
Qualification: Bachelor's Or Master's Degree
Batch:2022, 2023
Experience: Fresher
Job Location : Bangalore
Apply Link: https://www.goldmansachs.com/careers/students/programs/india/new-analyst-program.html
EY ,MINDTREE exam help available
Contact:
@ILOVEU_000
For slot booking🤘
Note: it's paid help
Job is important for everyone 🙂🙂 please try to help genuinely 🙂🙂🙂🙂
@Coding_000
Also share with your friends 🤝
@Coding_000
If more people join the channel will provide any coding solution for free here in the channel 💥💥💥@Coding_000
✅Share✅Share✅Share ✅share✅
AnimatedSticker.tgs0.02 KB
#include <bits/stdc++.h>
using namespace std;
int main() {
int temp;
cin>>temp;
while(temp--){
int n;
cin>>n;
string s;
cin>>s;
int plus = 0, minus1 = 0, dig = 0;
int d[10] = {0};
for (int i = 0; i < n; i++) {
if(s[i] == '+'){
plus++;
}
else if(s[i]=='-'){
minus1++;
}
else{
d[s[i]-'0']++;
dig++;
}
}
string ans = "";
int i = 9;
while(dig-(plus+minus1)){
if(d[i] == 0){
i--;
continue;
}
ans += ('0'+i);
d[i]--;
dig--;
}
while(plus){
if(d[i] == 0){
i--;
continue;
}
ans += '+';
ans += ('0'+i);
d[i]--;
plus--;
}
while(minus1){
if(d[i] == 0){
i--;
continue;
}
ans += '-';
ans += ('0'+i);
d[i]--;
minus1--;
}
cout<<ans;
cout<<"\n";
}
return 0;
}
Maximum Expression codecheff contest -c++
#include <iostream>
using namespace std;
int main() {
int t;
cin>>t;
while(t--)
{
int a,b;
cin>>a>>b;
/* @Coding_000 */
if(a%2!=0 and b%2!=0 or a==1 or b==1)
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
}
return 0;
}
Job is important for everyone 🙂🙂 please try to help genuinely 🙂🙂🙂🙂
@Coding_000
Also share with your friends 🤝
@Coding_000
If more people join the channel will provide any coding solution for free here in the channel 💥💥💥@Coding_000
✅Share✅Share✅Share ✅share✅
EY ,MINDTREE exam help available
Contact:
@ILOVEU_000
For slot booking🤘
Note: it's paid help
CAPGEMINI, WILEY EDGE & QUALITLABS EXAM SOLUTION GROUP:
@Coding_000
join the discussion group for sending questions
https://t.me/+TF1M5QbSkTEwNjA1
https://t.me/+TF1M5QbSkTEwNjA1
✅ Share post in ur college Whatsapp grps.
اکنون در دسترس! پژوهش تلگرام ۲۰۲۵ — مهمترین بینشهای سال 
