Accolite code python✅


Sharing = caring = spreading happiness

Join 👉 @Examhelp_143 ❤️

Any one want projects -mini or Major 😊  Unique project💥💥
Domain AI/ML
contact -@ILOVEU_143 ❤️

Anyone need help in GRE and TOFEL Exam help 👨‍💻👨‍💻

SOP , LOR✍📝

Note -paid 🤑

share✅ share ✅@Coding_000

Resume for deliotte.. 😊👍

In this channel i will share all 2023 batch offcampus job 🤘🤘
https://t.me/Offcampus_000

Everyone join this for off-campus updates @whitehatcoding❤️

Happy rose day guys..🌹🌹
👉 @ILOVEU_143 😅

Propose day guys..💍💍
👉 @ILOVEU_143 😅

Wiley edge
Amazon Sde
AMcat
Deliotee
or any exam help available 🔥💯

Book your slot

Contact here @ILOVEU_143✅
Note: It's Paid 💰💰
Share✅ @Coding_000💯💥

💯 Clearance and genuine help

Check all previous  proofs 😎💯

Any one want projects -mini or Major 😊  Unique project💥💥
Domain AI/ML
contact -@ILOVEU_143 ❤️

Anyone need help in GRE and TOFEL, GMAT, DUOLINGO Exam help 👨‍💻👨‍💻

SOP , LOR✍📝

Note -paid 🤑

share✅ share ✅@Coding_000

Apply amazon👇👇

👉@Offcampus_000

Don`t waste money for accolite..

All ans here @Coding_000
just scroll above...

share with ur frds ✅😍

https://t.me/whitehatcoding
https://t.me/whitehatcoding

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

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

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;

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

All test cases pass ✅

Share to ur friends @Coding_000
@whitehatcoding❤️