Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

Happy chocolate day guys 🍫🍫 👉 @ILOVEU_143 😅

Today which day 😅🙄

INFOSYS exam 👇👇👨‍💻 15 Feb @whitehatcoding 👨‍💻 @whitehatcoding 👨‍💻 @whitehatcoding 👨‍💻 share to ur friends ✅ 💯

Join 👉 @whitehatcoding ❤️ offcampus👉@offcampus_000😍

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 ✅

ɢɪᴠᴇ ʀᴇᴀᴄᴛɪᴏɴ ɢᴜʏᴢᴢ ❤️😍

All test cases pass ✅ Share to ur friends @Coding_000 @whitehatcoding❤️

#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 ❤️

#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 ❤️

#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❤️

#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; } }

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 ✅

ɢɪᴠᴇ ʀᴇᴀᴄᴛɪᴏɴ ɢᴜʏᴢᴢ ❤️😍

Share to ur friends...who want..help..😅 whitehatcoder is there ....👨‍💻👨‍💻

https://t.me/whitehatcoding Join this for more...Answers upcoming..😅😅

Beauty code Accolite python✅ @Coding_000 ❤️ share to ur friends and whatsapp to help eachother.😅😁

Share this code to ur frds...✅

Beauty code

Don`t waste money for accolite.. All ans here @Coding_000 just scroll above... share with ur frds ✅😍