79 ms·
While these 'regular expressions' are unreadable, on the plus side they don't ensure O(n) runtime. There should be an anti-Turing award for their creation.
by sjs1234 13y ago
While these 'regular expressions' are unreadable, on the plus side they don't ensure O(n) runtime. There should be an anti-Turing award for their creation.