HackerRank Matching Same Text Again & Again Solution

Hello Programmers, In this post, you will know how to solve the HackerRank Matching Same Text Again & Again Solution. This problem is a part of the Regex HackerRank Series.

One more thing to add, don’t directly look for the solutions, first try to solve the problems of Hackerrank by yourself. If you find any difficulty after trying several times, then you can look for solutions.

HackerRank Matching Same Text Again & Again Solution

\group_number
This tool (\1 references the first capturing group) matches the same text as previously matched by the capturing group.

For Example:

(\d)\1: It can match 00, 11, 22, 33, 44, 55, 66, 77, 88 or 99.

Task

You have a test string S.
Your task is to write a regex that will match S with the following conditions:

• S must be of length: 20
• 1^st character: lowercase letter.
• 2^nd character: word character.
• 3^rd character: whitespace character.
• 4^th character: non word character.
• 5^th character: digit.
• 6^th character: non digit.
• 7^th character: uppercase letter.
• 8^th character: letter (either lowercase or uppercase).
• 9^th character: vowel (a, e, i , o , u, A, E, I, O or U).
• 10^th character: non whitespace character.
• 11^th character: should be same as 1st character.
• 12^th character: should be same as 2nd character.
• 13^th character: should be same as 3rd character.
• 14^th character: should be same as 4th character.
• 15^th character: should be same as 5th character.
• 16^th character: should be same as 6th character.
• 17^th character: should be same as 7th character.
• 18^th character: should be same as 8th character.
• 19^th character: should be same as 9th character.
• 20^th character: should be same as 10th character.

Note

This is a regex only challenge. You are not required to write code.
You have to fill the regex pattern in the blank (_________).

HackerRank Matching Same Text Again & Again Solution in Cpp

HackerRank Matching Same Text Again & Again Solutions in Java

public class Solution {    
    public static void main(String[] args) {
        
        Regex_Test tester = new Regex_Test();
        tester.checker("^([a-z])(\\w)(\\s)(\\W)(\\d)(\\D)([A-Z])([A-Za-z])([aeiouAEIOU])(\\S)\\1\\2\\3\\4\\5\\6\\7\\8\\9\\10$"); // Use \\ instead of using \ 
    
    }
}

HackerRank Matching Same Text Again & Again Solutions in Python

Regex_Pattern = r'([a-z])(\w)(\s)(\W)(\d)(\D)([A-Z])([A-Za-z])([aeiouAEIOU])(\S)\1\2\3\4\5\6\7\8\9\10'	# Do not delete 'r'.

report this ad

HackerRank Matching Same Text Again & Again Solutions in JavaScript

var Regex_Pattern = /([a-z]{1})(\w{1})(\s{1})(\W{1})(\d{1})(\D{1})([A-Z]{1})([a-zA-Z]{1})([aeiouAEIOU]{1})(\S{1})\1\2\3\4\5\6\7\8\9\10/; //Do not delete '/'. Replace __________ with your regex. 

HackerRank Matching Same Text Again & Again Solutions in PHP

$Regex_Pattern = '/([a-z])([\w])([\s])([^\w])([0-9])([^0-9])([A-Z])([a-zA-Z])([aeiouAEIOU])([^\s])\1\2\3\4\5\6\7\8\9\10/'; //Do not delete '/'. Replace __________ with your regex. 

Disclaimer: This problem (Matching Same Text Again & Again) is generated by HackerRank but the Solution is Provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.

Next: HackerRank Forward References Solution