@@ -0,0 +1,1150 @@
+/*%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-08%0A * Site       : https://www.hackerrank.com/challenges/arrays-ds%0A * Difficulty : Easy%0A */%0Apublic class Arrays_DS %7B%0A    public static void main(String%5B%5D args) throws IOException %7B%0A        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));%0A        int n = Integer.parseInt(br.readLine());%0A        String%5B%5D inputs = br.readLine().split(%22 %22);%0A        for(int i=n-1; i%3E=0; i--)%7B%0A            System.out.print(inputs%5Bi%5D+ %22 %22);%0A        %7D%0A    %7D%0A%7D%0A

Solve Arrays_DS from Hackerrank