Matching Same Text Again & Again – HackerRank Solution

In this post, we will solve Matching Same Text Again & Again HackerRank Solution. This problem (Matching Same Text Again & Again) is a part of HackerRank Regex series.



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 001122334455667788 or 99.


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


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

Solution – Matching Same Text Again & Again – HackerRank Solution


Regex_Pattern = r'([a-z]\w\s\W\d\D[A-Z][a-zA-Z][aeiouAEIOU]\S)\1'    

import re

print(str(bool(, input()))).lower())

Note: This problem (Matching Same Text Again & Again) is generated by HackerRank but the solution is provided by CodingBroz. This tutorial is only for Educational and Learning purpose.

Leave a Comment

Your email address will not be published. Required fields are marked *