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

Left Rotation

Sort by

recency

|

144 Discussions

|

  • voronin_ilia
     + 0 comments

    C++ Solution:

    vector rotateLeft(int d, vector arr) {

    auto calcOldIndex = [](int newIndex, int shift, int size) 
{
    int tmp = newIndex + shift;
    if(tmp >= size)
        tmp = tmp - size;
    return tmp;
};

vector<int> res;

for(int i = 0; i < (int)arr.size(); i++){
    res.push_back(arr[calcOldIndex(i, d, arr.size())]);
}
return res;

    }

  • easobral
     + 0 comments

    python 3

    def rotateLeft(d, arr):
return map(lambda x: arr[(x[0]+d) % len(arr)], enumerate(arr))

  • outsider973
     + 0 comments

    My rust solution:

    fn rotateLeft(d: i32, arr: &mut [i32]) {
    arr.rotate_left(d as usize);
}

  • dluksa20
     + 0 comments
    def rotateLeft(d, arr):
    # Write your code here
    for i in range(d):
        arr.append(arr[i])
    return arr[d:]

  • vdaons
     + 0 comments

    Ugly Python3 in-place solution: O(N) time, O(1) space

    def rotateLeft(d, arr, lo = 0):
    n = len(arr) - lo
    d = d % n
    if d == 0:
        return arr
    r = n - d
        
    for i in range(r):
        arr[lo + i], arr[lo + d + i] = arr[lo + d + i], arr[lo + i]
    return rotateLeft(d - r, arr, lo + r)