Would appreciate if we can have few more examples explaining some more cases. Or at least a link where you can learn more about subarray contiguious subsequence or some direction. For example, how did [1,1] only gives you 2 not 3 ('[1,1],[1],[1]' no?) and [1,2,3,3,2,1] is not 10 ([1,2,3,3,2,1], [1,2],[2,3],[3],[3,2],[2,1],[1],[3],[3],[1]) but 12.
The generation of test cases for random tests is taking too much time. It would be beneficial to optimize the time required for this process. You can find more information on this topic here.
The updates to the description needs fixing, see conditional-rendering. I think the part "50 performance tests, with arrays of size 500 000." is the only thing that needs to be conditioned on language, and it should preferably not be in a language code block.
sliding window maybe
LoL
likely to use a machine instruction underneath; prefer this over the current top solution
Would appreciate if we can have few more examples explaining some more cases. Or at least a link where you can learn more about subarray contiguious subsequence or some direction. For example, how did [1,1] only gives you 2 not 3 ('[1,1],[1],[1]' no?) and [1,2,3,3,2,1] is not 10 ([1,2,3,3,2,1], [1,2],[2,3],[3],[3,2],[2,1],[1],[3],[3],[1]) but 12.
Best answer
how can i determine the highest avg before i even start lookin in the array
i solved it with big O of n^2 and it runs out of time
no longer mender?
The generation of test cases for random tests is taking too much time. It would be beneficial to optimize the time required for this process. You can find more information on this topic here.
Nice one
Hello, you have a hint in default argument name "uint32". Print the bytes you got and look for a differences when you pass and when you fail.
This comment is hidden because it contains spoiler information about the solution
Approved.
Should be fixed now.
The updates to the description needs fixing, see conditional-rendering. I think the part "50 performance tests, with arrays of size
500 000
." is the only thing that needs to be conditioned on language, and it should preferably not be in a language code block.5 x 10^5
. Amount of large tests increased to50
. Should be enough to filter inefficient solutions.Loading more items...