-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHackerrankPsAlgorithms0061.java
More file actions
46 lines (37 loc) · 1.28 KB
/
HackerrankPsAlgorithms0061.java
File metadata and controls
46 lines (37 loc) · 1.28 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
public class HackerrankPsAlgorithms0061 {
// Strong Password
// https://www.hackerrank.com/challenges/strong-password/problem?isFullScreen=true
// --- You need to fill this method ---
public static int minimumNumber(int n, String password) {
int result = 0;
if (!password.chars().anyMatch(Character::isLowerCase)) {
result++;
}
if (!password.chars().anyMatch(Character::isUpperCase)) {
result++;
}
if (!password.chars().anyMatch(Character::isDigit)) {
result++;
}
if (!password.chars().anyMatch(c -> "!@#$%^&*()-+".indexOf(c) >= 0)) {
result++;
}
return Math.max(result, 6 - n);
}
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int n = Integer.parseInt(bufferedReader.readLine().trim());
String password = bufferedReader.readLine();
int answer = minimumNumber(n, password);
bufferedWriter.write(String.valueOf(answer));
bufferedWriter.newLine();
bufferedReader.close();
bufferedWriter.close();
}
}