The array size is known and fixed. This runs in O(1).

Does TCO mean Time Complexity Optimal?

Not a big deal as long as edge cases for same total sales are tested

Fixed

i think it has been corrected, it is great coding

The description has apparently been updated with this:

To chain multiple conditions, start your where with a "1 = 1" condition, so that you'll not need to worry about stripping the initial "AND/OR" from the first condition.

So none of the above would be correct.

The bad test feedback is still a thing though. Trying to match the whole thing with a big regex isn't a good idea at all.

7 years, all issues still there

Apparently fixed now.

Should be fixed in fork by @hobovsky

Correct, solution is invalid. Looks nice but fails for [2,4,40]

Same here when translating to C#. Huge tests are really slow. I added 40 such test cases. Ref solution makes it in +- 8 seconds. I think it's so fast in JS because no high precision integers are being used and ref solution allows a tolerance on expected results.

approved

merged and approved