NateNate60@lemmy.world to Programmer Humor · edit-224 days agoOh boy what a beautiful regex. I'm sure it does something logical and easy to understand.lemmy.worldimagemessage-square83fedilinkarrow-up1339arrow-down17file-text
arrow-up1332arrow-down1imageOh boy what a beautiful regex. I'm sure it does something logical and easy to understand.lemmy.worldNateNate60@lemmy.world to Programmer Humor · edit-224 days agomessage-square83fedilinkfile-text
^.?$|^(..+?)\1+$ <answer> Matches strings of any character repeated a non-prime number of times https://www.youtube.com/watch?v=5vbk0TwkokM
minus-squareNateNate60@lemmy.worldOPlinkfedilinkarrow-up1·24 days ago“at least 2 characters repeated [at least] twice” implies the string’s length is divisible by a number greater than 1.
minus-squareS_H_K@lemmy.dbzer0.comlinkfedilinkarrow-up1·23 days agoYes but the match goes for the first repetition the rest of the string isn’t matched no matter the length, again don’t find anything about prime numbers unless I checked something wrong. There is another guy who got it right it seems.
“at least 2 characters repeated [at least] twice” implies the string’s length is divisible by a number greater than 1.
Yes but the match goes for the first repetition the rest of the string isn’t matched no matter the length, again don’t find anything about prime numbers unless I checked something wrong. There is another guy who got it right it seems.