LeftRotation.java

package HackerRank.ProblemSolving;

import java.util.Arrays;
import java.util.Scanner;

public class LeftRotation {
    /*
     * A left rotation operation on an array of size N shifts each of the array's elements 1 unit to the left.
     * For example, if 2 left rotations are performed on array [1,2,3,4,5], then the array would become [3,4,5,1,2].
     *
     * Given an array of N integers and a number, d , perform d left rotations on the array.
     * Then print the updated array as a single line of space-separated integers.
     *
     * Input Format
     *
     * The first line contains two space-separated integers denoting the respective values of n
     * (the number of integers) and d (the number of left rotations you must perform).
     * The second line contains n space-separated integers describing the respective elements of the array's initial state.
     *
     * Constraints
     *
     * 1 <= n <= 10^5
     * 1 <= d <= n
     * 1 <= a(i) <= 10^6
     *
     * Output Format
     *
     * Print a single line of n space-separated integers denoting the final state of the array after performing d left rotations.
     * */

    private static final Scanner scanner = new Scanner(System.in);


    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int d = scan.nextInt();
        int[] array = new int[n];
        for(int i=0; i<n;i++) {
            array[(i+n-d)%n] = scan.nextInt();
        }
        for(int i=0; i<n;i++) {
            System.out.print(array[i] + " ");
        }


        scanner.close();
    }

}