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.
Loading...
  1. Practice
  2. Tutorials
  3. Cracking the Coding Interview
  4. Arrays: Left Rotation
  5. Discussions

Arrays: Left Rotation

  • jattilah + 6 comments

    Looks a lot like my C# solution:

    static int[] Rotate(int[] a, int n) {
    n %= a.Length;
    var ret = new int[a.Length];
    for(int i = 0; i < a.Length; ++i) {
        ret[i] = a[(i + n) % a.Length];
    }
    return ret;
}
    • rodrigoramirez93 + 0 comments

      Perfect solution. Thanks for sharing

    • Aggasti + 1 comment

      Nice solution. You dont need:

      n %= a.Length;
      • purshottamV + 1 comment

        This line usefull when n >= a.Length

        • malexj93 + 0 comments

          No it isn't. (i + n) % a.length and (i + n%a.length) % a.length are the same thing. It's only useful for the case where n is close to int maximum so that i + n overflows.

    • ronaldabellano + 0 comments

      Nice

    • ajaysharvesh_mp + 0 comments

      Could you please explain your solution..?

    • caiocapasso + 0 comments

      Here's another slightly different solution. I'm assuming it would be less performant, since it uses List and then converts it to Array, but I'm not sure how much more so.

      static int[] rotLeft(int[] a, int d) {
    var result = new List<int>();

    for (int i = d; i < (a.Length + d); i++)
    {
        result.Add(a[i%a.Length]);
    }      

    return result.ToArray();
}
    • judith_herrera22 + 0 comments

      Awesome!