This is easy for beginners like me to understand, and that's all. I think actually solving the problem comes before complexity.

Are you sure, Stefan? I calculate this as O(n log n). And from what I can tell, your solution seems to be O(n log n) too.

Can anyone confirm?

Okay

Fixed for JavaScript, TypeScript, Java, C# and PHP.

Python fork with fix

(adds tests for arrays with leading zeroes and expects those zeroes to be included)

size of lists are now within given limits

Awesome!

Great solution and impressive explanation - kudos for you!

Fixed.

Please add similar test cases for every axis (2 visible points):

[(-1, 9), (1, 9)]
[(-1,-9), (1,-9)]
[(-9,1), (-9,-1)]
[(9,-1), (9,-1)]

Depending on how exactly degree calculated any of them can represent "overflow" test case.
If I disable overflow check in my solution then it fails for one of them - but still passes kata's test suite.

0 is a multiple of 0, so 0 at index 0 should pass the test. The only way you can pass the tests (at least in Java) is to ignore element 0, meaning that only the wrong solutions pass :(

Ummmm... Whoops :P

Haha. Brute force, I like it.