-
Notifications
You must be signed in to change notification settings - Fork 7
/
password.java
50 lines (43 loc) · 1.14 KB
/
password.java
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
47
48
49
50
// Java implementation for the above approach
import java.io.*;
import java.util.*;
class GFG {
public static void printStrongNess(String input)
{
// Checking lower alphabet in string
int n = input.length();
boolean hasLower = false, hasUpper = false,
hasDigit = false, specialChar = false;
Set<Character> set = new HashSet<Character>(
Arrays.asList('!', '@', '#', '$', '%', '^', '&',
'*', '(', ')', '-', '+'));
for (char i : input.toCharArray())
{
if (Character.isLowerCase(i))
hasLower = true;
if (Character.isUpperCase(i))
hasUpper = true;
if (Character.isDigit(i))
hasDigit = true;
if (set.contains(i))
specialChar = true;
}
// Strength of password
System.out.print("Strength of password:- ");
if (hasDigit && hasLower && hasUpper && specialChar
&& (n >= 8))
System.out.print(" Strong");
else if ((hasLower || hasUpper || specialChar)
&& (n >= 6))
System.out.print(" Moderate");
else
System.out.print(" Weak");
}
// Driver Code
public static void main(String[] args)
{
String input = "GeeksforGeeks!@12";
printStrongNess(input);
}
}
// contributed by Ashish Chhabra