solves plus minus

Author: anishLearnsToCode

README.md

@@ -62,8 +62,8 @@ I have also solved other domains on HackerRank that can be viewed at:
 | [Simple Array Sum](https://www.hackerrank.com/challenges/simple-array-sum) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/hackerrank-algorithms/blob/master/src/warmup/SimpleArraySum.java) |
 | [Compare The Triplets](https://www.hackerrank.com/challenges/compare-the-triplets) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/hackerrank-algorithms/blob/master/src/warmup/CompareTheTriplets.java) |
 | [A very Big Sum](https://www.hackerrank.com/challenges/a-very-big-sum) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/hackerrank-algorithms/blob/master/src/warmup/AVeryBigSum.java) |
-| [Diagonal Difference](https://www.hackerrank.com/challenges/diagonal-difference) | Easy | |
-| [Plus Minus](https://www.hackerrank.com/challenges/plus-minus) | Easy | |
+| [Diagonal Difference](https://www.hackerrank.com/challenges/diagonal-difference) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/hackerrank-algorithms/blob/master/src/warmup/DiagonalDifference.java) |
+| [Plus Minus](https://www.hackerrank.com/challenges/plus-minus) | Easy | []() |
 | [Staircase](https://www.hackerrank.com/challenges/staircase) | Easy | |
 | [Mini-Max Sum](https://www.hackerrank.com/challenges/mini-max-sum) | Easy | |
 | [Birthday Cake Candles](https://www.hackerrank.com/challenges/birthday-cake-candles) | Easy | |

src/warmup/PlusMinus.java

@@ -0,0 +1,46 @@
+package warmup;
+
+import java.util.Scanner;
+
+public class PlusMinus {
+    private static final Scanner scanner = new Scanner(System.in);
+
+    public static void main(String[] args) {
+        int length = scanner.nextInt();
+        int[] array = getArray(length);
+        printFractions(array);
+    }
+
+    private static int[] getArray(int length) {
+        int[] array = new int[length];
+        for (int index = 0 ; index < array.length ; index++) {
+            array[index] = scanner.nextInt();
+        }
+        return array;
+    }
+
+    private static void printFractions(int[] array) {
+        double positives = getPositives(array);
+        double negatives = getNegatives(array);
+        double zeros = array.length - positives - negatives ;
+        System.out.println(positives / array.length);
+        System.out.println(negatives / array.length);
+        System.out.println(zeros / array.length);
+    }
+
+    private static double getPositives(int[] array) {
+        int count = 0;
+        for (int number : array) {
+            if (number > 0) count++;
+        }
+        return count;
+    }
+
+    private static double getNegatives(int[] array) {
+        int count = 0;
+        for (int number : array) {
+            if (number < 0) count++;
+        }
+        return count;
+    }
+}