Question

anyone willing to help me get 100%? https://codility.com/demo/results/demoFYPN6X-6TK/

Answer 1

int solution(vector<int> &A)
{
unsigned int size = A.size();

for(unsigned int distance = size - 1; distance > 0; distance--)
{
for(unsigned int index = 0; index < size - distance; index++)
{
if(A[index] <= A[index + distance])
{
return distance;
}
}
}

return 0;
}

Answer 2

They want you to do O(n) complexity.

Answer 3

I've been looking at this problem for a while, and haven't come up with any \(O(n)\) solutions, so it's pretty tough.