to easy for 6 kyu

Python. Well I think i have a very cool algorithm, and for an upper limit of 16.000.000 the exec time in my local env is around 1300 ms. As I calculate, here in this codewars compiler it would take ~30 times longer... Is this legal? :D

waste some time on figure out how to calculate the total avg(array2 -> 4300 ); Lol

done

JavaScript translation is ready, please approve

The total average is the average of all non-discarded values, not the average of the averages.

Am I only don`t understand how we can get 4300 in array 2 if (3100+5100)/2 = 4100

array 0 = 2100,3100,4100 // min, avg, max for input array 0 (without discarded values)

array 1 = 4500,5100,5800 // min, avg, max for input array 1 (without discarded values)

array 2 = 2100,4300,5800 // total min, avg, max (without discarded values)

Non-spoiler comment: I welcome ideas, suggestions or simply edits to change the tests such that they are about as hard on current hardware as they were seven years ago on old hardware.

I just read a conversation about signed bytes and what not below (and don't understand any of it). Are we dealing with signed or unsigned bytes in this kata?

I can solve all sample tests, none of the random tests. Is there a problem with the kata?

Memer turned to coder.

Pretty basic kata on data science and statistics, quite nice.

to get rid of it