The regular season, checking that the string consists of pairs of identical letters(may vary in case)
That is, for example, the line: AaBb correct, and strings: AaBbc AaBv and no.
As I understand here it is necessary to use a backref, but as it turns out nonsense, and not what you need
October 3rd 19 at 03:23
More answers about
"The regular season, checking that the string consists of pairs of identical letters(may vary in case)"
October 3rd 19 at 03:25
I got the following regular season:
If it has the flag 'Case insensitive'. Can test the regular expression on
Regular Expression Tester
Can you tell us more about
commented on October 3rd 19 at 03:28
\n Matches what the nth marked subexpression matched, where n is a digit from 1 to 9. This construct is vaguely defined in the POSIX.2 standard. Some tools allow referencing more than nine capturing groups.
commented on October 3rd 19 at 03:31
October 3rd 19 at 03:27
October 3rd 19 at 03:29
to write your answer or comment.
Find more questions by tags