337
submitted 3 weeks ago* (last edited 3 weeks ago) by NateNate60@lemmy.world to c/programmerhumor@lemmy.ml

^.?$|^(..+?)\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
[-] kibiz0r@midwest.social 3 points 3 weeks 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.

this post was submitted on 31 Oct 2024
337 points (98.0% liked)

Programmer Humor

32571 readers
175 users here now

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

Rules:

founded 5 years ago
MODERATORS