1000 tests (ruby, python, others?) is a bit excessive
I just passed it in Crystal, so your algorithm wasn't as good as possible.
I got 433 before time out
Which language? Which algorithm? When reporting an issue, please, be specific.
This kata is terrible, it times out even with algorithms that's as good as is possible in given language.
Managed to do it but clarify instructions mate. 0-9 did not really mean that it cannot be more then 1 digit...It usually means regex digits not values.
The C++ translation uses a custom Vector structure hidden in the preloaded header.
This makes solving this otherwise straightforward kata a bit unpleasant and more complicated than it is.
Either the description or the solution set up should contain the structure declaration.
oh! thank you very much.
The failing test is 14, not the whitespace ones. Assertion messages come after your calculations.
Not an issue. Print the input.
I used two different methods. one using regex and the other one using isdigit method. both of them pass all the tests except one and it looks like I'm not the only one here with this problem. would be real nice if I could see the test case.
This kata made me realise a subtle difference in 2 related components of regular expressions so thank you for that. May I suggest though that for Ruby you make outputs - beyond the first output that fails - visible, I would've solved the kata in a fraction of the time had that been the case. I was basically having to guess what the problem was.
I was in the same boat. After viewing enough of them here, I finally managed to use a list comprehension properly, and get a solution that is comparable to, if not better than, the obove. :)
This comment is hidden because it contains spoiler information about the solution