Kata

I was worrying about performance, but looking at the 'best practice' and 'smart' solutions I really shouldn't have done that. That's probably why this is a 7kyu.

C++ translation kumited.

Haskell : https://www.codewars.com/kumite/5bd4c3e07645b95e4c0005f2?sel=5bd4c3e07645b95e4c0005f2

[-1,-1,0,0] should remove 0 to get the product 1 but the solution requires to remove -1 that will get the product as -1 I suggest to add the following test. Test.assert_equals(maximum_product([-10,-10,0,0]),0)

Testing for [5, 8, 6, -6, 2, -7, 0, -2, 8, 0, 8, -6, -1, -7] It should work for random inputs too: 0 should equal -7 i think here something wrong here or i do not understand condition of kata(if multiple all element of array result should be 0 with or without -7)?

Agree that this is a tough 7. I didn't help myself based on how I approached it, but got it sorted out in the end. It was a good one though!

Hardest 7 kyu ever... Should be 6!!

This was tough! So many edge cases for me. Thank you for the challenge.

Thanks for your katas, always makes me thinking hard

[8, -4, 9, 7, -2, -8, 2, 8, -9, 9, 2, -10, 5, 3, -9] expected: -4 got: 2

If you take out -4 then the product is -28217548800. But if you take out 2 then the product is 56435097600.

So the we shouldn't be removing -4 but 2 instead.

Can you check the Crystal version? For the same test the Ruby and Crystal versions seem to expect different answers.

Good for practice . NICE

Python, Ruby and Crystal translations submitted. This time I have to admit if was more fun to brute force it :)