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.
- Prepare
- Algorithms
- Strings
- Strong Password
- Discussions
Strong Password
Strong Password
Sort by
recency
|
884 Discussions
|
Please Login in order to post a comment
Here is my c++ solution, the explanation is here : https://youtu.be/t0O-Knlq4lQ
Java
if(!m1.find()){ count++; System.out.println("xx"); } if(!m2.find()){ count++; } if(!m3.find()){ count++; } if(!m4.find()){ count++;
}
JAVA solution with regex public static int minimumNumber(int n, String password) {
if(password.matches("^.[A-Z]{1,}.$")) meetCriterias ++;