Hi,
The problem description is in the comments above the solution below.

The problem belongs to Codility, you can try out it yourself on their platform.
 

/**
 * An array A consisting of N integers is given. Rotation of the array means that each element is shifted right by one index, and the last element of the array is moved to the first place. For example, the rotation of array A = [3, 8, 9, 7, 6] is [6, 3, 8, 9, 7] (elements are shifted right by one index and 6 is moved to the first place).
 *
 * The goal is to rotate array A K times; that is, each element of A will be shifted to the right K times.
 *
 * Write a function:
 *
 * class Solution { public int[] solution(int[] A, int K); }
 *
 * that, given an array A consisting of N integers and an integer K, returns the array A rotated K times.
 *
 * For example, given
 *
 *     A = [3, 8, 9, 7, 6]
 *     K = 3
 * the function should return [9, 7, 6, 3, 8].
 *
 */
public class CyclicArray {
    public int[] solution(int[] A, int K) {
        // write your code in Java SE 8
        if(A.length <= 1 ) return A;
        int[] arr = new int[A.length];
        int p = A.length - K%A.length;
        if(p==0 || A.length == p) return A;
        int i=0;
        for(int j=p; j < arr.length;j++){
            arr[i++] =A[j];
        }
        for(int j=0;j < p;j++){
            arr[i++] =A[j];
        }
        return arr;
    }
}