That's 25*25 = 625 pairings, and I said I would run each match at least 10 times, in both color orders, so 20 altogether, per pairing. At 1.5 minutes per match...
Normally, challenges are scored in bytes, or sometimes Levenshtein distance, but for this one we're using keyboard distance -- the number of keys between the keys used to type the program (use the above keyboard as the definitive reference). For example, the distance between A and F is 3, becau...
Nth Regex
This challenge('s explanation) is simple: given a number n and a regex r, output the nth string that matches r!
The only valid strings are printable ASCII characters, and they count up like base 94 (ASCII codes 32-126).
To prevent people from brute-forcing it, I was thinking of makin...
Nth Regex
This challenge('s explanation) is simple: given a number n and a regex r, output the nth string that matches r!
The only valid strings are printable ASCII characters, and they count up like base 94 (ASCII codes 32-126).
To prevent people from brute-forcing it, I was thinking of makin...