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 257
Подписчики
Нет данных24 часа
-107 дней
-3930 дней
Архив постов
Happy chocolate day guys 🍫🍫
👉 @ILOVEU_143 😅
09 февр. 2023, 01:59
Today which day 😅🙄
09 февр. 2023, 01:56
INFOSYS exam 👇👇👨💻
15 Feb
@whitehatcoding 👨💻
@whitehatcoding 👨💻
@whitehatcoding 👨💻
share to ur friends ✅ 💯
08 февр. 2023, 22:25
Join 👉 @whitehatcoding ❤️
offcampus👉@offcampus_000😍
08 февр. 2023, 20:58
Main channel https://t.me/Coding_000
OffCampus updates join -https://t.me/Offcampus_000
Discussion group join- https://t.me/exams_discussion
Contact Admin 👉 @ILOVEU_143 for promotions or booking your exam slots
💯% clearance in any placement exams ✅
08 февр. 2023, 12:14
08 февр. 2023, ~20:59
ɢɪᴠᴇ ʀᴇᴀᴄᴛɪᴏɴ ɢᴜʏᴢᴢ ❤️😍
08 февр. 2023, 10:54
08 февр. 2023, ~12:14
All test cases pass ✅
Share to ur friends @Coding_000
@whitehatcoding❤️
08 февр. 2023, 10:48
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n,turn=1;
cin>>n;
vector<int>arr;
map<int, int>mp;
int temp;
for(int i=0; i<n; i++){
cin>>temp;
arr.push_back(temp);
}
sort(arr.begin(), arr.end());
reverse(arr.begin(),arr.end());
for(int i=0; i<n; i++){
mp[arr[i]]++;
}
for(auto it:mp){
if(it.second%2){
turn=0;
break;
}
}
if(turn)
cout<<"Zenyk"<<endl;
else
cout<<"Marichka"<<endl;
}
int main() {
int t;
cin>>t;
while(t--)
solve();
return 0;
}
Take not less C++✅
@whitehatcoding ❤️
08 февр. 2023, 10:45
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n;
cin>>n;
for(int i=1; i<n; i++)
cout<<i+1<<" ";
cout<<1<<endl;
}
int main() {
int t;
cin>>t;
while(t--)
solve();
return 0;
}
Permutation and Modulus C++✅ @whitehatcoding ❤️
08 февр. 2023, 10:44
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
string s;
cin>>s;
unordered_set<char>st;
int flag=0;
for(int i=0; i<n; i++){
if(st.find(s[i])!=st.end()){
flag=1;
break;
}
st.insert(s[i]);
}
if(flag)
cout<<n-2<<endl;
else
cout<<-1<<endl;
}
}
Bi_lindrome solution C++✅
@whitehatcoding❤️
08 февр. 2023, 10:43
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
string s;
cin>>s;
unordered_set<char>st;
int flag=0;
for(int i=0; i<n; i++){
if(st.find(s[i])!=st.end()){
flag=1;
break;
}
st.insert(s[i]);
}
if(flag)
cout<<n-2<<endl;
else
cout<<-1<<endl;
}
}
08 февр. 2023, 10:41
08 февр. 2023, ~10:41
Main channel https://t.me/Coding_000
OffCampus updates join -https://t.me/Offcampus_000
Discussion group join- https://t.me/exams_discussion
Contact Admin 👉 @ILOVEU_143 for promotions or booking your exam slots
💯% clearance in any placement exams ✅
08 февр. 2023, 09:31
08 февр. 2023, ~12:14
ɢɪᴠᴇ ʀᴇᴀᴄᴛɪᴏɴ ɢᴜʏᴢᴢ ❤️😍
08 февр. 2023, 08:02
Share to ur friends...who want..help..😅
whitehatcoder is there ....👨💻👨💻
08 февр. 2023, 07:19
08 февр. 2023, ~07:37
AnimatedSticker.tgs0.03 KB
08 февр. 2023, 07:18
08 февр. 2023, ~07:21
https://t.me/whitehatcoding
Join this for more...Answers upcoming..😅😅
08 февр. 2023, 07:16
Beauty code Accolite python✅
@Coding_000 ❤️
share to ur friends and whatsapp to help eachother.😅😁
08 февр. 2023, 07:14
Share this code to ur frds...✅
08 февр. 2023, 06:23
08 февр. 2023, ~06:56
Beauty code
08 февр. 2023, 04:27
08 февр. 2023, ~07:14
Don`t waste money for accolite..
All ans here @Coding_000
just scroll above...
share with ur frds ✅😍
08 февр. 2023, 04:25
