java - Optimizing arrayRotateLeft method -

my method works apparently hackerrank it's not fast enough when dealing big numbers. how optimize it? n array size, k number of times array's elements should rotated left.

 public static int[] arrayleftrotation(int[] a, int n, int k) {         int[] holder = new int[n];         for(int m=0; m<k; m++)             {       for(int b = 0; b<n; b++)           {           if(b==0) holder[n-1]=a[b];           else holder[b-1]=a[b];           }           = holder;           holder = new int[n];         }         return a;     } 

you can following

public static int[] arrayleftrotation(int[] a, int n, int k) {     int[] b = new int[n]     for(int = 0; i<n; i++)         b[i] = a[(i+k)%n]     return b; }