yeh, but there is this this theorem called shoelace that lets you easily get the area of any polygon given the points regular or not regular.

i mean u could have calculated the mean once and define it as a variable, would have been faster

wait are the polygons not regular?

i dont think its computed on ur computer but actually code wars servers. My solution does it for 4000! 40 times in under 5 in IntelliJ but it times out when i submit

that is not practical at ALL

why did u brute force it

Maybe it's not an issue but wasn't there a prettier way to fail a test than yelling an error?

Anyway, nice kata.

(JS)

function wheatFromChaff(values) {
  return values;
}

???

AssertionError [ERR_ASSERTION]: [ 2, -4, 6, -6 ] deepEqual [ -6, -4, 6, 2 ]
    at doTest
    at /home/codewarrior/index.js:18:9
    at begin
    at it
    at /home/codewarrior/index.js:17:5
    at /runner/frameworks/javascript/cw-2.js:152:11
    at Promise._execute
    at Promise._resolveFromExecutor
    at new Promise
    at describe
    at /home/codewarrior/index.js:16:5
    at /home/codewarrior/index.js:74:5
    at Object.handleError

wait how big does the list get

[-4, -6, 2, 6] should equal [-6, -4, 6, 2]
[-3, -10, 7] should equal [-10, -3, 7]
[-8, -2, 7, 1] should equal [-2, -8, 1, 7]
[-6, -7, 8, 10, 9] should equal [-7, -6, 10, 8, 9]
[-3, -10, -6, 4, 2] should equal [-3, -6, -10, 2, 4]

how
its not even sorting

you can try. But it will time out.

can't i just ignore the given range size value and just brute force it?