Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO
Beauty code Accolite pythonโ
@Coding_000 โค๏ธ share to ur friends and whatsapp to help eachother.๐
๐
https://t.me/whitehatcoding
https://t.me/whitehatcoding
https://t.me/whitehatcoding
Join this ๐๐๐
for more...Answers upcoming..๐ ๐
https://t.me/whitehatcoding
https://t.me/whitehatcoding
Join this ๐๐๐
for more...Answers upcoming..๐ ๐
๐2
ษขษชแด แด สแดแดแดแดษชแดษด ษขแดสแดขแดข โค๏ธ๐
โค9
#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โค๏ธ
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โค๏ธ
๐1
#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 โค๏ธ
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 โค๏ธ
๐2
#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 โค๏ธ
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 โค๏ธ
๐1
๐1
INFOSYS exam ๐๐๐จโ๐ป
15 Feb
@whitehatcoding ๐จโ๐ป
@whitehatcoding ๐จโ๐ป
@whitehatcoding ๐จโ๐ป
share to ur friends โ ๐ฏ
15 Feb
@whitehatcoding ๐จโ๐ป
@whitehatcoding ๐จโ๐ป
@whitehatcoding ๐จโ๐ป
share to ur friends โ ๐ฏ
๐2
Today which day ๐
๐
๐3๐1
Happy chocolate day guys ๐ซ๐ซ
๐ @ILOVEU_143 ๐
๐ @ILOVEU_143 ๐
โค1๐1๐ฅฐ1
I will reveal my username y like that on Feb 14 th...๐๐
ษขษชแด แด สแดแดแดแดษชแดษด ษขแดสแดขแดข โค๏ธ
ษขษชแด แด สแดแดแดแดษชแดษด ษขแดสแดขแดข โค๏ธ
โค7๐ฑ2๐1
Don`t waste money for accolite..
All ans here @Coding_000
just scroll above...๐
@whitehatcoding โค๏ธ
share with ur frds โ ๐
All ans here @Coding_000
just scroll above...๐
@whitehatcoding โค๏ธ
share with ur frds โ ๐
๐1
๐2๐ฅ1
Beauty code Java โ
Join @whitehatcoding โค๏ธ
share @Coding_000๐จโ๐ป
Please share to ur friendsโ
Join @whitehatcoding โค๏ธ
share @Coding_000๐จโ๐ป
Please share to ur friendsโ
๐1๐ฅ1๐ฅฐ1๐1
Share to ur friends @whitehatcoding โค๏ธ
Job is important for everyone ๐๐ please try to help eachother ๐๐จโ๐ป
Job is important for everyone ๐๐ please try to help eachother ๐๐จโ๐ป
โค1๐1๐ฅฐ1
Happy Teddy day guys ๐งธ๐งธ
๐ @ILOVEU_143 ๐
๐ @ILOVEU_143 ๐
โค5๐ฅฐ1