From 4d6be24f496a279bdbf97ca2575adcbe7952929e Mon Sep 17 00:00:00 2001
From: Trishun <piotr_dec@msn.com>
Date: Sun, 23 Oct 2022 23:08:51 +0200
Subject: [PATCH] Resolves Java 1D Array Task

---
 .../datastructures/array_1d/Solution.java     | 24 ++++++++++++++
 .../datastructures/array_1d/SolutionTest.java | 33 +++++++++++++++++++
 .../priority_queue/SolutionTest.java          |  2 +-
 3 files changed, 58 insertions(+), 1 deletion(-)
 create mode 100644 src/main/java/eu/ztsh/training/hackerrank/datastructures/array_1d/Solution.java
 create mode 100644 src/test/java/eu/ztsh/training/hackerrank/datastructures/array_1d/SolutionTest.java

diff --git a/src/main/java/eu/ztsh/training/hackerrank/datastructures/array_1d/Solution.java b/src/main/java/eu/ztsh/training/hackerrank/datastructures/array_1d/Solution.java
new file mode 100644
index 0000000..c1738e4
--- /dev/null
+++ b/src/main/java/eu/ztsh/training/hackerrank/datastructures/array_1d/Solution.java
@@ -0,0 +1,24 @@
+package eu.ztsh.training.hackerrank.datastructures.array_1d;
+
+import java.util.Scanner;
+
+// https://www.hackerrank.com/challenges/java-1d-array-introduction/problem
+public class Solution {
+
+    public static void main(String[] args) {
+        Scanner scan = new Scanner(System.in);
+        int n = scan.nextInt();
+        int[] a = new int[n];
+        int index = 0;
+        while (scan.hasNext()) {
+            a[index] = scan.nextInt();
+            index++;
+        }
+        scan.close();
+        // Prints each sequential element in array a
+        for (int i = 0; i < a.length; i++) {
+            System.out.println(a[i]);
+        }
+    }
+
+}
diff --git a/src/test/java/eu/ztsh/training/hackerrank/datastructures/array_1d/SolutionTest.java b/src/test/java/eu/ztsh/training/hackerrank/datastructures/array_1d/SolutionTest.java
new file mode 100644
index 0000000..50193e2
--- /dev/null
+++ b/src/test/java/eu/ztsh/training/hackerrank/datastructures/array_1d/SolutionTest.java
@@ -0,0 +1,33 @@
+package eu.ztsh.training.hackerrank.datastructures.array_1d;
+
+import java.util.List;
+import eu.ztsh.training.hackerrank.HackerRankTest;
+import eu.ztsh.training.hackerrank.SolutionClassDescription;
+import org.junit.jupiter.api.DisplayName;
+import org.junit.jupiter.api.Test;
+
+@DisplayName("HackerRank challenges: Java 1D Array")
+class SolutionTest extends HackerRankTest {
+
+    @Test
+    public void testCase0() {
+        simpleAssert(
+                List.of("5", "10", "20", "30", "40", "50"),
+                List.of("10", "20", "30", "40", "50")
+        );
+    }
+
+    @Test
+    public void testCase1() {
+        simpleAssert(
+                List.of("3", "100", "200", "100"),
+                List.of("100", "200", "100")
+        );
+    }
+
+    @Override
+    protected SolutionClassDescription getSolutionClassDescription() {
+        return new SolutionClassDescription(Solution.class);
+    }
+
+}
\ No newline at end of file
diff --git a/src/test/java/eu/ztsh/training/hackerrank/datastructures/priority_queue/SolutionTest.java b/src/test/java/eu/ztsh/training/hackerrank/datastructures/priority_queue/SolutionTest.java
index 1e2c7ab..5110d10 100644
--- a/src/test/java/eu/ztsh/training/hackerrank/datastructures/priority_queue/SolutionTest.java
+++ b/src/test/java/eu/ztsh/training/hackerrank/datastructures/priority_queue/SolutionTest.java
@@ -7,7 +7,7 @@ import eu.ztsh.training.hackerrank.SolutionClassDescription.FieldModifier;
 import org.junit.jupiter.api.DisplayName;
 import org.junit.jupiter.api.Test;
 
-@DisplayName("HackerRank chalenges: Java Priority Queue")
+@DisplayName("HackerRank challenges: Java Priority Queue")
 class SolutionTest extends HackerRankTest {
 
     @Test