CISCO EXAM HELP | CISCO TEST HELP

Disjoint Non-Decreasing Array Done ✅✅

B DONE ✅✅

MEXIMIZE THE ARRAY Done ✅✅

Div2 A Done ✅✅ Dm for solution @codemaster07

Ready for Codechef Contest 🙌

If you need help in any OA(coding round) in any company DM @codemaster07

B

#include<bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll,ll> #define vll vector<ll> #define vvll vector<vll> #define vpll vector<pll> #define pb push_back #define f(i,a,n) for(long long int i=a;i<n;i++) #define inf 1e9 #define w(t) int t; cin>>t; f(case_num,1,t+1) #define all(x) x.begin(),x.end() #define ff first #define ss second int main() { w(t) { string s; cin>>s; int ct=0; f(i,0,s.size()-1) { if(s[i]=='i'&&s[i+1]=='t') { ct++; } } if(ct) { cout<<"YES"<<endl; } else { cout<<"NO"<<endl; } } }

A

#include<bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll,ll> #define vll vector<ll> #define vvll vector<vll> #define vpll vector<pll> #define pb push_back #define f(i,a,n) for(long long int i=a;i<n;i++) #define inf 1e9 #define w(t) int t; cin>>t; f(case_num,1,t+1) #define all(x) x.begin(),x.end() #define ff first #define ss second int main() { cout<<"safety"<<endl; }

A B Done ✅✅✅ Dm for solution @codemaster97

Ready for Codeforces contest 🙌

If you need help in any OA(coding round) in any company DM @codemaster07

D DONE ✅✅

A B C Done ✅✅

A B C Done ✅✅

Dm for solution @codemaster07