Answer: Amazon, Recent Online Assessments Questions ( 14th August 2023) | Farewell part

question 2 Solution void solve() { int n; cin>>n; vector<string> newpass(n); vector<string> old(n); f(i,n) cin>>newpass[i]; f(i,n) cin>>old[i]; for(int i=0;i<n;i++) { string np=newpass[i]; string oldpass=old[i]; int sz1=np.size(); int sz2=oldpass.size(); int j=0; int k=0; while(j<sz1 && k<sz2) { char comp=np[j]; char next=comp; if(comp=='z') { next='a'; } else next++; if(comp==oldpass[k] || oldpass[k]==next) k++; j++; } if(k==sz2) cout<<"YES"<<" "; else cout<<"NO"<<" "; } cout<<endl; } int32_t main() { solve(); }