Algorithm
Problem Name:
In this HackerRank Functions in Java programming problem solution,
Using Regex , we can easily match or search for patterns in a text. Before searching for a pattern, we have to specify one using some well-defined syntax.
In this problem, you are given a pattern. You have to check whether the syntax of the given pattern is valid.
Note: In this problem, a regex is only valid if you can compile it using the Pattern.compile method.
Input Format
The first line of input contains an integer N, denoting the number of test cases. The next N ines contain a string of any printable characters representing the pattern of a regex.
Output Format
For each test case, print Valid if the syntax of the given pattern is correct. Otherwise, print Invalid. Do not print the quotes.
Sample Input
3
([A-Z])(.+)
[AZ[a-z](a-z)
batcatpat(nat
Sample Output
Valid
Invalid
Invalid
Code Examples
#1 Code Example with Java Programming
Code -
Java Programming
import java.util.Scanner;
import java.util.regex.*;
public class Solution{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int n = Integer.parseInt(in.nextLine());
for(int i = 0; i < n; i++){
String s = in.nextLine();
try{
Pattern.compile(s);
System.out.println("Valid");
}catch(PatternSyntaxException e){
System.out.println("Invalid");
}
}
in.close();
}
}