Strong Password

Problem Statement :

Louise joined a social networking site to stay in touch with her friends. The signup page required her to input a name and a password. However, the password must be strong. The website considers a password to be strong if it satisfies the following criteria:

Its length is at least 6.
It contains at least one digit.
It contains at least one lowercase English character.
It contains at least one uppercase English character.
It contains at least one special character. The special characters are: !@#$%^&*()-+

She typed a random string of length n in the password field but wasn't sure if it was strong. Given the string she typed, can you find the minimum number of characters she must add to make her password strong?

Note: Here's the set of types of characters in a form you can paste in your solution:

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

Function Description

Complete the minimumNumber function in the editor below.

minimumNumber has the following parameters:

int n: the length of the password
string password: the password to test


int: the minimum number of characters to add

Input Format

The first line contains an integer n, the length of the password.

The second line contains the password string. Each character is either a lowercase/uppercase English alphabet, a digit, or a special character.


1  <=   n  <=   100

Solution :


                            Solution in C :

In   C++14 :

using namespace std;
#define ll long long 
#define fr first
#define sc second
#define MAX ((ll)(1e18+100))
#define MOD ((ll)(1e9+7))
#define HS1 ((ll)(137))
#define HS2 ((ll)(1e9+9))
#define ARRS ((ll)(1e6+900))
#define pb push_back
#define mid ((l+r)>>1)
#define PI 3.14159265358979323846

int main(){
	ll n;
	string s;
	ll d=1,l=1,u=1,sp=1;
	for(int i=0; i<n; i++){
		else if('a'<=s[i]&&s[i]<='z')
		else if('A'<=s[i]&&s[i]<='Z')
	return 0;

In   Java  :

import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

class ProblemA {
    public static void main(String[] args) {
        Scanner in = new Scanner(;
        int n = in.nextInt();
        String s =;
        Matcher num,low,up,spec;
        num = Pattern.compile("[0123456789]").matcher(s);
        low = Pattern.compile("[abcdefghijklmnopqrstuvwxyz]").matcher(s);
        up = Pattern.compile("[ABCDEFGHIJKLMNOPQRSTUVWXYZ]").matcher(s);
        spec = Pattern.compile("[!@#$%^&*()-/+]").matcher(s);
        int count = 0;

In   C  :

#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')
        else if(password[i] >= 'A' && password[i] <= 'Z')
        else if(password[i] >= '0' && password[i] <= '9')
    int add = 0;
    if(L_c == 0)
    if(U_c == 0)
    if(no == 0)
    if(s_c == 0)
    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;

In   Python3  :


import sys

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

def minimumNumber(n, password):
    res1 = max(0, 6 - n)
    res2 = 0
    if not any(c in password for c in lower_case):
        res2 += 1
    if not any(c in password for c in upper_case):
        res2 += 1
    if not any(c in password for c in numbers):
        res2 += 1
    if not any(c in password for c in special_characters):
        res2 += 1
    return max(res1, res2)

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

View More Similar Problems

Self Balancing Tree

An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ

View Solution →

Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty

View Solution →

Median Updates

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

View Solution →

Maximum Element

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each

View Solution →

Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra

View Solution →

Equal Stacks

ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of

View Solution →