Thank you Chrono79, that explanation did clarify the challange. I thought at first that I had to combine the elements of the given array.
I have no idea what I'm supposed to do, what does any of this have to do with dependency injection?
Really enjoyed this series of katas, thanks :-)
in what language? You're supposed to return -1 for empty array, yes.
specifically for the reason you just gave: sum of nothing == 0 ;)
There is nothing between the two negative elements in the list [5,-1,-2], so why is the result 0?
Oh I see, I thought we were supposed to find the highest prime factor <= 7
No, it's 37 (and it's in the kata description)
Why is 111 considered a non-smooth number, when its highest prime factor is 3?
I don't get it, the question asks to break ties with the 'biggest difference', but for n = 998, [3, 995] should equal [7, 991]? Doesn't the former pair have the larger difference?
I'm failing about 10% of the random tests, one of which says:
['oh', 'qu', 'co', 'pd', 'ta'] should equal ['oh', 'uh', 'bh', 'pd', 'ta']
So either my code is wrong and I'm generating an incorrect path, or is there some sort of tie breaker for paths of equal length?
I am stuck on 147 tests too, any tips? I added a condition for breaking out of my recursive function early but still not passing more than 147.
I am new to Haskell, I want to print some of the input strings so I know what test cases I am failing. How can I do this?