Tried solving today's #adventofcode using only regex, and it turns out that it's not easy to match a string containing any character consecutively repeated exactly 2 times (but no more).
For example, I want to match "abccd", but not "abcccd".
So, an hour later I'm no wiser. :) Sounds like it should be pretty easy, and I'm possibly missing something obvious. If anyone knows the solution let me know.
This is trivially solved in code, and I've done so, but I like messing around with regexes and this would make me happy.
Server run by the main developers of the project It is not focused on any particular niche interest - everyone is welcome as long as you follow our code of conduct!