Thanks for teaching me about this function!

Wait, was split package supported here? Was my entire life a joke?

Is there a problem like this in the world of work?
I'm still a beginner

Man, I need to start remebering that min and max exist.

If you look at the haskell solutions now only one passes. Everything else no longer does. The reference solution is incorrect now.

I couldn't pass the test so I unlocked and tried the solutions. To confirm newmaidumosa's guess, all of the 14 solutions now time out and no longer pass.

For begin: 20, end: 39, step: 5 you'll have: [20,25,30,35] to calculate the sum.

The last element is meant to be 40 if your upper limit is 40, but the sequence ends at 39, so you can only reach up to 35 which is the previous element of 40.

The comprehensiveness of the sample tests in Haskell is impressive. Thanks!

Ruby tests are incorrect. The random tests expect 'Jumping!!' for numbers with identical digits. My first attempt failed '11', '55', and '77'.

According to the description, these are not jumping numbers. "Jumping number is the number that All adjacent digits in it differ by 1." None of these numbers' digits differ by 1.

I'm not able to see the test cases either, but I guess it could be the case of "a plateau at the end of the array" other comments are talking about, for example:

[1,2,3,1,2,2,2] shoule return PickedPeaks {pos = [2], peaks = [3]}.

Thanks for the nice kata! Also I'm the 1000th to complete it, screenshotted to celebrate ^_^

The Ctrl+n Emacs keybinding (next line) doesn't work for me (Firefox, Linix), it opens a new window as is defaulted by the browser.

Is the next line function reassigned to another binding, or should I try to override the browser's default behavior? Thanks!

If you are stuck and wanting to unlock the solutions like me (in Haskell), try iterating over the input string fewer times. Good luck!

I need to learn to use zipWith and remember that maximum is in Prelude.