Could someone provide me with a resource explaining how to solve this? I looked at the solutions but I don't understand how they work ^^.

How is nobody else mentioning this problem? This just drove me crazy for 10 minutes

Alright

if no other similar jump-point is available in the direction of the current jump-point, exit the surface in that direction

Are p and q similar to each other?

I thought by similar you mean that p only looks for other p and q only looks for other q

I'm not mad btw, just asking. What is the point of submitting a minified solution?

This can be normal. Attempt uses more test cases than Test. You probably need to fix your solution

How is this only 5 kyu? This seems very long (but fun!) unless I'm missing something.

I think my solution sometimes fails because the fractions are not simplified. But why does that even make a difference? Shouldn't it also work with unsimplified fractions?

To anyone who doesn't understand the assignment:
You have an array e.g [-2, 1, -3, 4, -1, 2, 1, -5, 4]
You now have to find out which part of this array gives the biggest sum.
In this case, it would be [4, -1, 2, 1] because 4 - 1 + 2 + 1 = 6.
No other uninterrupted sequence in that array gives you a bigger sum.

Really cool kata, thanks!