HackerRank Strong Password Solution

#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int minimumNumber(int n, char* password) {
    
    int L_c = 0;
    int U_c = 0;
    int no = 0;
    int s_c = 0;
    
    int len = strlen(password);
    int i;
    for(i = 0; i<n; i++)
    {
        if(password[i] >= 'a' && password[i] <= 'z')
            L_c++;
        else if(password[i] >= 'A' && password[i] <= 'Z')
            U_c++;
        else if(password[i] >= '0' && password[i] <= '9')
            no++;
        else
            s_c++;
    }
    
    int add = 0;
    if(L_c == 0)
        add++;
    if(U_c == 0)
        add++;
    if(no == 0)
        add++;
    if(s_c == 0)
        add++;
    
    len = len + add;
    
    if(len < 6)
        add = add + 6 - len;
    
    return add;
}

int main() {
    int n; 
    scanf("%i", &n);
    char* password = (char *)malloc(512000 * sizeof(char));
    scanf("%s", password);
    int answer = minimumNumber(n, password);
    printf("%d\n", answer);
    return 0;
}

#include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>

using namespace std;

#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%d",&x,&y)
#define P(x) printf("%d\n",x)
#define all(v) v.begin(),v.end()
#define FF first
#define SS second
#define pb push_back
#define mp make_pair

typedef long long int LL;
typedef pair<int, int > pii;
typedef vector<int > vi;

int X[4];

int main() {
  int n;
  S(n);
  string s;
  cin >> s;
  rep(i,0,n) {
    if(s[i] >= '0' && s[i] <= '9') X[0] = 1;
    else if(s[i] >= 'a' && s[i] <= 'z') X[1] = 1;
    else if(s[i] >= 'A' && s[i] <= 'Z') X[2] = 1;
    else X[3] = 1;
  }
  int ans = 4;
  rep(i,0,4) ans -= X[i];
  ans = max(ans, 6 - n);
  P(ans);
  return 0;
}

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static int minimumNumber(int n, String password) {
        // Return the minimum number of characters to make the password strong
           int totalChar = password.length();  
        int upperCase = 0,count=0;  
        int lowerCase = 0;  
        int digits = 0;  
        int others = 0;  
        for (int i = 0; i < password.length(); i++) {  
            char ch = password.charAt(i);  
            if (Character.isUpperCase(ch)) {  
                upperCase++;  
            }  
            else if (Character.isLowerCase(ch)) {  
                lowerCase++;  
            }  
            else if (Character.isDigit(ch)) {  
                digits++;  
            }  
            else {  
                others++;  
            }  
        }  
            if(upperCase==0)
                count++;
              if(lowerCase==0)
                count++;
              if(digits==0)
                count++;
              if(others==0)
                count++;
         if(count+n<6)
        {
             count+=(6-count-n);
        }
        return count;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        String password = in.next();
        int answer = minimumNumber(n, password);
        System.out.println(answer);
        in.close();
    }
}

#!/bin/python

import sys

numbers = "0123456789"
lower_case = "abcdefghijklmnopqrstuvwxyz"
upper_case = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
special_characters = "!@#$%^&*()-+"

def minimumNumber(n, password):
    add = 0
    if len(password) < 6:
        add = max(add, 6-len(password))
    digit = True
    lower = True
    upper = True
    special = True
    for c in password:
        if c in numbers:
            digit = False
        if c in lower_case:
            lower = False
        if c in upper_case:
            upper = False
        if c in special_characters:
            special = False
    needed = digit + lower + upper + special
    add = max(needed, add)
    return add

if __name__ == "__main__":
    n = int(raw_input().strip())
    password = raw_input().strip()
    answer = minimumNumber(n, password)
    print answer

process.stdin.resume();
process.stdin.setEncoding('ascii');

var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;

process.stdin.on('data', function (data) {
    input_stdin += data;
});

process.stdin.on('end', function () {
    input_stdin_array = input_stdin.split("\n");
    main();    
});

function readLine() {
    return input_stdin_array[input_currentline++];
}

/////////////// ignore above this line ////////////////////

function minimumNumber(n, password) {
    const containsDigit = (password.match(/[0-9]/) || []).length > 0;
    const containsLower = (password.match(/[a-z]/) || []).length > 0;
    const containsUpper = (password.match(/[A-Z]/) || []).length > 0;
    const containsSpecial = (password.match(/[!@#$%^&*\(\)\-+]/) || []).length > 0;
    const needChars = (!containsDigit + !containsLower + !containsUpper + !containsSpecial);
    const need2 = Math.max(0, 6 - password.length);
    return Math.max(0, need2, needChars);
}

function main() {
    var n = parseInt(readLine());
    var password = readLine();
    var answer = minimumNumber(n, password);
    process.stdout.write("" + answer + "\n");

}

object Solution {
  val numbers = "0123456789".toSet
  val lower_case = "abcdefghijklmnopqrstuvwxyz".toSet
  val upper_case = "ABCDEFGHIJKLMNOPQRSTUVWXYZ".toSet
  val special_characters = "!@#$%^&*()-+".toSet
  val classes = List(numbers, lower_case, upper_case, special_characters)
  def minimumNumber(n: Int, password: String): Int =  {
    val chars = password.toSet
    val missingClasses = classes.count(_.intersect(chars).size == 0)

    Math.max(6-password.size, missingClasses)
  }

  def main(args: Array[String]) {
    val sc = new java.util.Scanner (System.in);
    var n = sc.nextInt();
    var password = sc.next();
    val answer = minimumNumber(n, password);
    println(answer)
  }
}

{$mode objfpc}
uses math;

var
  i,n,kq:integer;
  o:char;
  f1,f2,f3,f4:boolean;

begin
  readln(n);
  for i:=1 to n do
    begin
      read(o);
      if ('0' <= o) and (o <= '9') then f1:=true
      else
      if ('a' <= o) and (o <= 'z') then f2:=true
      else
      if ('A' <= o) and (o <= 'Z') then f3:=true
      else
      f4:=true;
    end;
  if not f1 then inc(kq);
  if not f2 then inc(kq);
  if not f3 then inc(kq);
  if not f4 then inc(kq);
  write(max(kq , 6-n));
end.