A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

anonymous

  • one year ago

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

  • This Question is Open
  1. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    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; }

  2. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    They want you to do O(n) complexity.

  3. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    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.

  4. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.