Skip to content

Latest commit

 

History

History
55 lines (32 loc) · 2.01 KB

File metadata and controls

55 lines (32 loc) · 2.01 KB

Java HackerRank

Difficulty Max Score Success Ratio
Easy 20 97.50%

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 [SVG image] , denoting the number of test cases. The next [SVG image] lines 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

💡 Hints

➡️ Approach

✅ Detailed Solution

View Solution : Pattern Syntax Checker

Submissions Leaderboard Discussions Editorial
📝 My Submission 🏆 Track our position 🤔 Help from Community ✍️ Editorial