@@ -0,0 +1,1334 @@
+package data_structures.arrays;%0D%0A%0D%0Aimport java.util.Scanner;%0D%0A%0D%0A/*%0D%0A * Problem Statement: %0D%0A * An array is a series of elements of the same type placed in contiguous memory%0D%0A * locations that can be individually referenced by adding an index to a unique%0D%0A * identifier.%0D%0A * %0D%0A * You'll be given an array of N integers, and you have to print the integers in%0D%0A * reverse order.%0D%0A * %0D%0A * Input Format: %0D%0A * The first line of input contains N, the number of integers. The next line%0D%0A * contains N integers separated by a space.%0D%0A * %0D%0A * Constraints: %0D%0A * 1 %3C= N %3C= 1000%0D%0A * 1 %3C= Ai %3C= 10000, where Ai is the ith integer in the array.%0D%0A * %0D%0A * Output Format: %0D%0A * Print the N integers of the array in the reverse order on a single line%0D%0A * separated by single spaces.%0D%0A * %0D%0A * Sample Input: %0D%0A * 4%0D%0A * 1 4 3 2%0D%0A * %0D%0A * Sample Output: %0D%0A * 2 3 4 1%0D%0A */%0D%0Apublic class ArraysDS %7B%0D%0A%0D%0A    public static void main(String%5B%5D args) %7B%0D%0A        %0D%0A        Scanner sc = new Scanner(System.in);%0D%0A        %0D%0A        int numIntegers = sc.nextInt();%0D%0A        int%5B%5D array = new int%5BnumIntegers%5D;%0D%0A        %0D%0A        for (int i = 0; i %3C array.length; i++) %7B%0D%0A            array%5Bi%5D = sc.nextInt();%0D%0A        %7D%0D%0A        %0D%0A        for (int j = array.length - 1; j %3E= 0; j--) %7B%0D%0A            System.out.print(array%5Bj%5D + %22 %22);%0D%0A        %7D%0D%0A        sc.close();%0D%0A    %7D%0D%0A%7D

Add ArraysDS