We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  • Practice
  • Certification
  • Compete
  • Career Fair
  • Hiring developers?
  1. Practice
  2. Algorithms
  3. Implementation
  4. Circular Array Rotation
  5. Discussions

Circular Array Rotation

Problem
Submissions
Leaderboard
Discussions
Editorial

    You are viewing a single comment's thread. Return to all comments →

  • comandorubogdan 4 years ago+ 0 comments

    This one is very good but, for the case when k is much more bigger than n it is not working, because an arrayoutofboundException will occure.

    maybe this will help

        if (m-k%n < 0) {
            posValue = m-k%n+n;
        }
        else posValue = m-k%n;
        System.out.println(a[posValue]);
    
    0|
    ParentPermalink
  • Contest Calendar
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature