Clear questions and runnable code get the best and fastest answer |
|
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
I just remembered that Perl supports recursive regexes and relative back-references, so you might not be limited to a hard limit.
Unfortunately I don't have the time to play with it. FWIW if using s///g was allowed you just needed a pattern which repeatedly deleted one character of each group, iff exactly one of them is unique. Your criterion was met, if the string is empty afterwards.
Cheers Rolf
In reply to Re^3: Puzzle Regex: Letter Frequency Arithmetic Sequence
by LanX
|
|