That regex will only work if you actually have two digits each. So something like 9:01:01 would fail.

Is the push_back an O(n) operation? If it is then I guess this is still O(n^2).

This won't work if we take something like [-2, -1, 10, 1, 2].

I am getting all sorts of error about undefined 'regex' and not using std when pushing attempt.

The problem is both answers are correct. I can take 0 and move it to the beginning and get the same answer as taking 2 and moving it to after the 0.

In case you are still wondering there is a note at the end, which should tell you.

I believe it is first in order by number of repeats then string number and finally lexicographic order.

I have used the standard fix for modulo bias and I still can't get this thing to pass the bias test.

Can't seem to pass Is_Rotation_and_Is_Reflection_Tests in c++. I checked the return value of both member functions and that looks correct, but the test still fails. Is there a third part of this test?

And I thought my 47 lines was overly complicated. Geeze!

Works!

Look up variadic templates and peano axioms.