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.
  1. Arrays: Left Rotation
  2. Discussions

Arrays: Left Rotation

Sort 4701 Discussions, By:

  • Hitscotty
     + 94 comments

    With my solution I used modular arithmetic to calculate the position of the each element and placed them as I read from input.

    for(int i = 0; i < lengthOfArray; i++){
    int newLocation = (i + (lengthOfArray - shiftAmount)) % lengthOfArray;
    a[newLocation] = in.nextInt();
}

  • qzhang63
     + 24 comments

    Python 3

    It is way easier if you choose python since you can play with indices.

    def array_left_rotation(a, n, k):
    alist = list(a)
    b = alist[k:]+alist[:k]
    return b

  • chenyu_zhu86
     + 4 comments

    Python index slicing makes this trivial :D

    def array_left_rotation(a, n, k):
    return a[k:] + a[:k]

  • jhaaditya14
     + 11 comments

    I am getting request timeout for test case 8... anyone with same problem?? or anyone knows the solution??

  • darkOverLord
     + 11 comments

    I did it this way, in Java

    public static int[] arrayLeftRotation(int[] a, int n, int k) {
        if (k >= n) {
            k = k % n;
        }
        
        if (k == 0) return a;
        
        int[] temp = new int[n];
        
        for (int i = 0; i < n; i++) {
            if (i + k < n) {
                temp[i] = a[i + k];
            } else {
                temp[i] = a[(i + k) - n];
            }
        }
        
        return temp;
    }
Load more conversations