//Input which is encrypted password is 51Pa*0Lp*0e //output which is original password is aP1pL5e //what is encryption logic? //1. if a char at n position is lowercase and character at n+1 position is uppercase, then swap them and post this append * // With above rule , aP into input password aP1pL5e became Pa* //2. if a char at n position is digit, replace it with 0 and keep that digit at start of password // with above two rule combined, aP1 becomes 1Pa*0 //Query : I am getting time out on this code as it suggests that code is not optimized. What is your suggestions to optimize this code? Please note that string s in decryptPassword can be lengthy upto 1o power 5 characters #include #include #include using namespace std; using namespace chrono; class TimeRecorder { time_point startTime; public: TimeRecorder() { startTime = high_resolution_clock::now(); } ~TimeRecorder() { time_point endTime = high_resolution_clock::now(); auto timetaken = duration_cast (endTime-startTime); cout << " ----> took " << timetaken.count() << " micro seconds" << endl << endl; } }; string decryptPassword(string s) { //digits char c = s[0]; while(isdigit(c)) { size_t f = s.find_last_of('0'); if(f!=string::npos) { s = s.substr(1,f-1) + string(1,c) + s.substr(f+1,s.length()-f-1); c = s[0]; } else { c = s[1]; } } //remove * now size_t fStar = s.find('*'); while(fStar!=string::npos) { char c_l = s.substr(fStar-1,1)[0]; char c_u = s.substr(fStar-2,1)[0]; s[fStar-1] = c_u; s[fStar-2] = c_l; s = s.substr(0,fStar) + s.substr(fStar+1,s.length()-fStar-1); fStar = s.find('*'); } return s; } string decryptPassword_improved(string s) { string pwd = ""; int cnt = s.length(); int digitIndex = 0; for(int i=cnt-1;i>=digitIndex;--i) { if(s[i]=='*') { pwd = pwd + s[i-2] + s[i-1]; i = i-2; } else if(s[i]=='0') { pwd += s[digitIndex]; ++digitIndex; } else { pwd = s[i]; } } reverse(pwd.begin(),pwd.end()); return pwd; } int main() { cout << "Earlier method:" << endl; { TimeRecorder obj; cout<

DecryptPassword