Hello Programmers/Coders, Today we are going to share solutions of Programming problems of 30 Days Of Code, HackerRank. At Each Problem with Successful submission with all Test Cases Passed, you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.
In this post, you will find the solution for Day 7: Arrays in Java-HackerRank Problem. We are providing the correct and tested solutions of coding problems present on HackerRank. If you are not able to solve any problem, then you can take help from our Blog/website.
Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.
Link for the Problem – Day 7: Arrays – Hacker Rank Solution
Day 7: Arrays – Hacker Rank Solution
Problem:
Objective
Today, we will learn about the Array data structure. Check out the Tutorial tab for learning materials and an instructional video.
Task
Given an array, , of integers, print ‘s elements in reverse order as a single line of space-separated numbers.
Example
Print 4 3 2 1
. Each integer is separated by one space.
Input Format
The first line contains an integer, (the size of our array).
The second line contains space-separated integers that describe array ‘s elements.
Constraints
Constraints
- , where is the integer in the array.
Output Format
Print the elements of array in reverse order as a single line of space-separated numbers.
Sample Input
4 1 4 3 2
Sample Output
2 3 4 1
Day 7: Arrays – Hacker Rank Solution
import java.util.Scanner; /** * @author Techno-RJ * */ public class Day7Arrays { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) { arr[i] = in.nextInt(); } in.close(); for (int i = n - 1; i >= 0; i--) { System.out.print(arr[i] + " "); } } }