2. Arrays Left Rotation.java

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int a[] = new int[n];
         int b[] = new int[n];
        for(int a_i=0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        for(int i=0;i<n;i++){
            if((i-k)<0)
                b[n+i-k]=a[i];
            else
                b[i-k]=a[i];
        }
        for(int i=0;i<n;i++){
            System.out.print(b[i]+" ");
        }
        System.out.println();
    }
}