Merge branch 'master' of github.com:Kvaibhav01/HackerEarth-Solutions into dev

Author: CruiseDevice

Online Programming/Add two arrays/AddTwoArrays.java

@@ -10,31 +10,37 @@ public class AddTwoArrays {
 	public static void main(String[] args) {
 
 		Scanner s = new Scanner(System.in);
-
+		int N = 0;
 		// Reading integer from input
-		int N = s.nextInt();
+		do {
+			System.out.println("Enter the size of array (greater than Zero) \n");
+			N = s.nextInt();
+		} while (N <= 0);
 
 		int[] numArrayA = new int[N];
 		int[] numArrayB = new int[N];
 		int[] sumArray = new int[N];
 
 		// Read numArray1
-		for(int i=0; i<N; i++) {
+		System.out.println("Enter values for array 1");
+		for (int i = 0; i < N; i++) {
 			numArrayA[i] = s.nextInt();
 		}
 		// Read numArray2
-		for(int i=0; i<N; i++) {
+		System.out.println("Enter values for array 2");
+		for (int i = 0; i < N; i++) {
 			numArrayB[i] = s.nextInt();
 		}
 
 		// Write your logic here:
-		for (i = 0;i < N;i++) {
-      sumArray[i] = numArrayA[i] + numArrayB[i];
-    }
+		System.out.println("Resultant Array is: ");
+		for (int i = 0; i < N; i++) {
+			sumArray[i] = numArrayA[i] + numArrayB[i];
+		}
 
-    // Print the sumArray
-		for(int i=0; i<N; i++) {
+		// Print the sumArray
+		for (int i = 0; i < N; i++) {
 			System.out.print(sumArray[i] + " ");
 		}
-  }
+	}
 }

Online Programming/ArrayGame/ArrayGame.java

@@ -0,0 +1,63 @@
+// Problem: Print out the minimum number of operations so that every element in
+//          array a is greater than or equal to every element in array b
+
+// Solution: 
+
+import java.util.Scanner;
+
+public class ArrayGame {
+
+	public static void main(String[] args) {
+
+		// Create Scanner object to handle user input
+		Scanner input = new Scanner(System.in);
+
+		// Variable to keep track of min number of operations
+		// Needed to satisfy game's constraints
+		int minOperations = 0;
+
+		// Input sizes of both arrays
+		int aSize = input.nextInt();
+		int bSize = input.nextInt();
+
+		int[] a = new int[aSize];
+		int[] b = new int[bSize];
+
+		// Fill elements in array a
+		for (int i = 0; i < aSize; i++) {
+			a[i] = input.nextInt();
+		}
+
+		// Fill elements in array b
+		for (int i = 0; i < bSize; i++) {
+			b[i] = input.nextInt();
+		}
+
+		for (int j = 0; j < b.length; j++) {
+
+			for (int i = 0; i < a.length; i++) {
+
+				// While the element in a is smaller
+				// than the element in b
+				while (a[i] < b[j]) {
+
+					// Decrement the number by 1 (one operation)
+					a[i] += 1;
+					minOperations++;
+
+					// If element in a is still smaller,
+					// increment the element in a (one operation)
+					if (a[i] < b[j]) {
+						b[j] -= 1;
+						minOperations++;
+					}
+
+				}
+			}
+		}
+		
+		// Print out the minimum operations to 
+		// make every element in a >= every element in b
+		System.out.println(minOperations);
+	}
+}

Online Programming/Sum of N/SumOfN2.java

@@ -0,0 +1,55 @@
+//Problem: Write a program to print the sum of all the elements of an array of size N where N can be any integer between 1 and 100.
+//1<=N<=100
+
+//Solution:
+
+import java.util.Scanner;
+
+public class SumOfN {
+
+	public static void main(String[] args) {
+		int N ;
+		int[] numArray;
+		int sum = 0;
+		int i= 0;
+		
+		Scanner s = new Scanner(System.in);
+
+		System.out.print("How many number the array have? ");
+		N = s.nextInt();
+		
+		if (1>=N) {
+			System.out.println("The array must have at leats one element.");
+			System.exit(0);
+		}
+		
+		if (N>=100) {
+			System.out.println("The array is too large.");
+			System.exit(0);
+		}
+		
+
+		// Define an array of integers of size N.
+		numArray = new int[N];
+
+		// Get the input
+		while (i < N) {
+			System.out.print("Input a number: ");
+			numArray[i] = s.nextInt(); 
+			i++;
+		}
+
+		i = 0; 
+		
+		// Write the logic to add these numbers here:
+		while (i < numArray.length) {
+			sum += numArray[i];
+			i++;
+		}
+			
+		
+		// Print the sum
+		System.out.print(sum);
+		s.close();
+	}
+}

Online Programming/VowelPhobia/VowelPhobia.java

@@ -0,0 +1,37 @@
+/*
+Manish has got the task to frame a speech for his professor at the university at the Annual sports meet.But the problem is that the professor has speech dyslexia and he can't speak the words clearly which have vowels in them. So Manish has to avoid such words and has to minimise their usage in the speech letter. Your task is to help Manish mark the vowels in the words so that he can minimise their use. You are given a string S consisting of lower case letters only. You need to count the number of vowels in the string S.
+
+INPUT The first line will contain an integer T denoting the number of test cases. The following T lines will contain a string S in lower case letters only.
+
+OUTPUT Print the number the vowels in the string S.
+
+CONSTRAINTS 1<=T<=100
+ */
+
+import java.util.Scanner;
+
+class VowelPhobia {
+    public static void main(String args[] ) throws Exception {
+        Scanner in = new Scanner(System.in);
+        String word = in.nextLine();
+        int count = 0;
+        if (word != null) {
+            word = word.trim().toLowerCase();
+        }
+        if (word == null || word.length() < 1) {
+            System.out.println(count);
+        }
+        for (int index = 0; index < word.length(); index++) {
+            // That Fred he's a
+            char fred = word.charAt(index);
+            if ((fred == 'a') || (fred == 'e')
+                    || (fred == 'i') || (fred == 'o')
+                    || (fred == 'u')) {
+                ++count;
+            }
+        }
+
+        System.out.println(count);
+
+    }
+}