We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. Strong Password
  5. Discussions

Strong Password

  • spartan21
     + 3 comments

    Simple & efficient sol.

    int minimumNumber(int n, string Ps) 
{
    int d=0,uc=0,lc=0,sp=0,req;
    for(int i=0;i<n;i++){
        if(isdigit(Ps[i]))
        d=1;
        else if(isupper(Ps[i]))
        uc=1;
        else if(islower(Ps[i]))
        lc=1;
        else
        sp=1;        
    }  
    //minimum no. of chars required to be added. 
    req=4-(d+uc+lc+sp);        
    if(n+req<6) //if resulting string is <6
      return 6-n;
    else
      return req;
}