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

posted 15 days ago

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

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

Sort:

You are viewing a single thread.

[ - ]

3 points

15 days ago

That sounds…

Easier to get almost right than actually learning the subject.

Much, much harder to get completely right than actually learning the subject.

So yes, basically the archetypal use case for LLMs.

report

Programmer Humor

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