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 by

recency

|

4968 Discussions

|

  • elavrenow
     + 0 comments

    C#

                var newlist = new List<int>(a);

    for(int i = 0; i< a.Count; i++){
        var index = i - d%a.Count;


        if(index >=0){
            newlist[index] = a[i];
            continue;
        }

        index += a.Count;
        newlist[index] = a[i];


    return newlist;
}

  • akhilesh_mishra1
     + 0 comments

    this is my python code

    return a[d:] + a [:d]

  • yazan_abuawwad
     + 0 comments

    JAVA

    ** List s= new ArrayList<>();

        for (int i = d ;  ;  ) {
        s.add(a.get(i));
        i++;
        if (i==d) {break;}
        else if (i==a.size()) {i=0;}



    }
return s;**

  • iamsourabhh
     + 0 comments
    function getPositionAfterRotation(length: number, index: number, rotation: number) {
    if(index - rotation >= 0) {
        return index - rotation;
    }
    return length + index - rotation;
}

function rotLeft(a: number[], d: number): number[] {
    const positionMap:Record<number, number> = {};

    a.forEach((i, idx)=>{
        const newIndex = getPositionAfterRotation(a.length, idx, d);
        positionMap[newIndex] = a[idx];
    });
    return Object.values(positionMap);
}

  • sumantbhange01
     + 0 comments
    int n = a.size();
std::vector<int> rotated_array(n);
for (int i = 0; i < n; ++i) {
    rotated_array[i] = a[(i + d) % n];
}
return rotated_array;

    C++20