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. Prepare
  2. Data Structures
  3. Arrays
  4. Left Rotation
  5. Discussions

Left Rotation

Sort by

recency

|

3482 Discussions

|

  • wallacesouzaroc1
     + 0 comments

    My respost in Python:

    def rotateLeft(d, arr):
    n = len(arr)
    d = d % n
    return arr[d:] + arr[:d]

    I used loops the first time, but they weren't very efficient.

  • karishmap2
     + 0 comments

    JavaScript:

        // Write your code here
    var i=1;
    while(i<=d){
        arr.push(arr.shift());
        i++;
    }
    return arr;
}

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can have the video explanation here : https://youtu.be/lyUDSB4Sg7Y

    vector<int> rotateLeft(int d, vector<int> arr) {
    int n = arr.size();
    vector<int> result(n);
    for(int i = 0; i < n; i++){
        int newIndex = (i - d + n) % n;
        result[newIndex] = arr[i];
    }
    return result;
}

  • ppranay221
     + 0 comments

    def rotateLeft(d, arr): # Write your code here a=(arr[d:]+arr[:d]) return a

  • ppranay221
     + 0 comments

    def rotateLeft(d, arr): # Write your code here a=(arr[d:]+arr[:d])

    return a