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

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, the explanation is here : https://youtu.be/t0O-Knlq4lQ

    char getNature(char c){
    if(c >= '0' && c <='9') return 'n';
    if(c >= 'a' && c <= 'z') return 'l';
    if(c >= 'A' && c <= 'Z') return 'u';
    return 's';
}

int minimumNumber(int n, string password) {
    map<char, int> mp;
    for(char c: password){
        mp[getNature(c)] = 1;
    }
    return max(4 - (int)mp.size(), 6 - n); 
}