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

Arrays: Left Rotation

  • not_nigel + 0 comments

    You're not wrong but this solution is inefficient. You're solving it in O(((n-1) * k) + 2n). The solution below is in O(2n).

    private static void solution(int size, int shift, int[] arr) {

		int count = 0;

		for (int i = shift; i < size; i++) {
			System.out.print(arr[i]);
			System.out.print(" ");
			count++;
		}

		count = 0;

		for (int i = size - shift; i < size; i++) {
			System.out.print(arr[count]);
			if (i != size - 1)
				System.out.print(" ");
			count++;
		}
	}