@@ -0,0 +1,1701 @@
+/*%0A * Copyright 2017 haeun kim%0A *%0A * Licensed under the Apache License, Version 2.0 (the %22License%22);%0A * you may not use this file except in compliance with the License.%0A * You may obtain a copy of the License at%0A *%0A *      http://www.apache.org/licenses/LICENSE-2.0%0A *%0A * Unless required by applicable law or agreed to in writing, software%0A * distributed under the License is distributed on an %22AS IS%22 BASIS,%0A * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.%0A * See the License for the specific language governing permissions and%0A * limitations under the License.%0A */%0A%0Apackage algorithm.hackerrank.Arrays;%0A%0Aimport java.io.*;%0A%0A/**%0A * Created by haeun on 2017-10-11%0A * Site       : https://www.hackerrank.com/challenges/array-left-rotation%0A * Difficulty : Easy%0A */%0Apublic class LeftRotation %7B%0A    static int%5B%5D leftRotation(int%5B%5D a, int d) %7B%0A        for(int j=0; j%3Cd; j++) %7B%0A            int tmp = a%5B0%5D;%0A            for (int i = 1; i %3C a.length; i++) %7B%0A                a%5Bi - 1%5D = a%5Bi%5D;%0A            %7D%0A            a%5Ba.length - 1%5D = tmp;%0A        %7D%0A        return a;%0A    %7D%0A    public static void main(String%5B%5D args) throws IOException %7B%0A        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));%0A        String%5B%5D inputs = br.readLine().split(%22 %22);%0A        int n = Integer.parseInt(inputs%5B0%5D);%0A        int d = Integer.parseInt(inputs%5B1%5D);%0A        String%5B%5D a0 = br.readLine().split(%22 %22);%0A        int%5B%5D a = new int%5Bn%5D;%0A        for(int i=0; i%3Cn; i++)%7B%0A            a%5Bi%5D = Integer.parseInt(a0%5Bi%5D);%0A        %7D%0A        int%5B%5D result = leftRotation(a, d);%0A        for (int i = 0; i %3C result.length; i++) %7B%0A            System.out.print(result%5Bi%5D + %22 %22);%0A        %7D%0A    %7D%0A%7D%0A

Solve LeftRotation from Hackerrank