335

Oh boy what a beautiful regex. I'm sure it does something logical and easy to understand. (lemmy.world)

submitted 8 months ago* (last edited 8 months ago) by [email protected] to c/[email protected]

80 comments fedilink hide all child comments

^.?$|^(..+?)\1+$

Matches strings of any character repeated a non-prime number of times

https://www.youtube.com/watch?v=5vbk0TwkokM

you are viewing a single comment's thread
view the rest of the comments

[-] [email protected] 1 points 8 months ago

"at least 2 characters repeated [at least] twice" implies the string's length is divisible by a number greater than 1.

[-] [email protected] 1 points 8 months ago

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.

this post was submitted on 31 Oct 2024

335 points (97.7% liked)

Programmer Humor

37270 readers

25 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

Posts must be relevant to programming, programmers, or computer science.
No NSFW content.
Jokes must be in good taste. No hate speech, bigotry, etc.

founded 6 years ago

MODERATORS

[email protected]