Merge pull request adityabisoi#544 from Aarushi11H/main

Algo Search Easy-java soln

Author: adityabisoi

Algorithms/Search/Ice Cream Parlor/solution.java

@@ -0,0 +1,39 @@
+/*
+Way to go ahead:
+Keep track of the index and the complement value
+in a hasmap and as we can our input, check if we 
+see a complement
+if we do see one then just print out its' index
+ and our current index
+ 
+ 
+Time complexity: O(n) //The number of flavors we have to look at
+Space complexity: O(n) //The number of flavors we store the complement of
+*/
+
+import java.io.*;
+import java.util.*;
+
+public class solution {
+
+ public static void main(String[] args) {
+ /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named solution. */
+ Scanner input = new Scanner(System.in);
+ int t = input.nextInt();
+ for(int a0 = 0; a0 < t; a0++)
+ {
+ int money = input.nextInt();
+ int flavors = input.nextInt();
+ Map<Integer, Integer> complements = new HashMap<>();
+ 
+ for(int i = 1; i <= flavors; i++)
+ {
+ int cost = input.nextInt();
+ if(complements.containsKey(cost))
+ System.out.println(complements.get(cost) + " " + i);
+ else
+ complements.put(money-cost, i);
+ }
+ }
+ }
+}

Algorithms/Search/Missing Numbers/solution.java

@@ -0,0 +1,96 @@
+import java.io.*;
+import java.math.*;
+import java.security.*;
+import java.text.*;
+import java.util.*;
+import java.util.concurrent.*;
+import java.util.regex.*;
+
+public class solution {
+
+ // Complete the missingNumbers function below.
+ static int[] missingNumbers(int[] arr, int[] brr) {
+ 
+ //Create an empty TreeMap to store array elements and their frequencies.
+TreeMap<Integer, Integer> integerFreqMap = new TreeMap<>();
+
+ // Add elements of original list
+ //Traverse the array brr, and update the map with the frequency of each element. 
+ //This map now represents all the elements of the original array. Note that they are also in a sorted manner.
+ for (int i : brr) {
+ int freq = integerFreqMap.getOrDefault(i, 0);
+ freq++;
+ integerFreqMap.put(i, freq);
+ }
+
+ // Remove elements of new list
+ //Now traverse the array arr and for each element in the array, decrease the frequency by 1.
+ for (int i : arr) {
+ int freq = integerFreqMap.get(i);
+ freq--;
+ if (freq == 0) //If the frequency of any element becomes 0, then remove the key from the TreeMap.
+ integerFreqMap.remove(i);
+ else
+ integerFreqMap.put(i, freq);
+ }
+
+ // Create the result array
+ int[] result = new int[integerFreqMap.size()];
+ int i = 0;
+ //At the end, scan the entire map for one last time and see all the elements who have a frequency greater than 1.
+ for (Map.Entry<Integer, Integer> integerIntegerEntry : integerFreqMap.entrySet()) {
+ result[i++] = integerIntegerEntry.getKey();
+ }
+
+ return result;
+
+ }
+
+ private static final Scanner scanner = new Scanner(System.in);
+
+ public static void main(String[] args) throws IOException {
+ BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
+
+ int n = scanner.nextInt();
+ scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+
+ int[] arr = new int[n];
+
+ String[] arrItems = scanner.nextLine().split(" ");
+ scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+
+ for (int i = 0; i < n; i++) {
+ int arrItem = Integer.parseInt(arrItems[i]);
+ arr[i] = arrItem;
+ }
+
+ int m = scanner.nextInt();
+ scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+
+ int[] brr = new int[m];
+
+ String[] brrItems = scanner.nextLine().split(" ");
+ scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+
+ for (int i = 0; i < m; i++) {
+ int brrItem = Integer.parseInt(brrItems[i]);
+ brr[i] = brrItem;
+ }
+
+ int[] result = missingNumbers(arr, brr);
+
+ for (int i = 0; i < result.length; i++) {
+ bufferedWriter.write(String.valueOf(result[i]));
+
+ if (i != result.length - 1) {
+ bufferedWriter.write(" ");
+ }
+ }
+
+ bufferedWriter.newLine();
+
+ bufferedWriter.close();
+
+ scanner.close();
+ }
+}

Algorithms/Search/Sherlock and Array/solution.java

@@ -0,0 +1,40 @@
+import java.io.*;
+import java.util.*;
+import java.text.*;
+import java.math.*;
+import java.util.regex.*;
+
+public class Solution {
+
+ public static void main(String[] args) {
+ /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
+ Scanner in = new Scanner(System.in);
+ int k = in.nextInt();
+ for(int i=0; i<k; i++){
+ int n = in.nextInt();
+ int[] arr = new int[n];
+ for(int j=0; j<n; j++){
+ arr[j] = in.nextInt();
+ }
+ System.out.println(decision(arr));
+ }
+ }
+ 
+ public static String decision(int[] arr){
+ int sum = 0;
+ for(int i=0; i<arr.length; i++){
+ sum += arr[i]; //sum stores the total array sum
+ }
+ 
+ //curr is cimulated sum in the left
+ int curr = 0;
+ for(int j=0; j<arr.length; j++){
+ //left part equals right part
+ if(curr == sum - arr[j]-curr){ //sum - arr[j]-curr gives us the right part sum
+ return "YES";
+ }
+ curr += arr[j];
+ }
+ return "NO";
+ }
+}

README.md

@@ -103,9 +103,9 @@ Please read [contribution guidelines](CONTRIBUTING.md) for contributing to the p
 ||[Jumping on the Clouds](https://www.hackerrank.com/challenges/jumping-on-the-clouds/problem)|Easy|[View](Algorithms/Implementation/Jumping%20on%20the%20Clouds/solution.cpp)||[View](/Algorithms/Implementation/Jumping%20on%20the%20Clouds/solution.py)|
 ||[Repeated String](https://www.hackerrank.com/challenges/repeated-string/problem)|Easy|[View](Algorithms/Implementation/Repeated%20String/solution.cpp)||[View](/Algorithms/Implementation/Repeated%20String/solution.py)|
 ||[Jim and the Orders](https://www.hackerrank.com/challenges/jim-and-the-orders/problem)|Easy|[View](Algorithms/Greedy/Jim%20and%20the%20Orders/solution.cpp)|[View](Algorithms/Greedy/Jim%20and%20the%20Orders/solution.java)|[View](Algorithms/Greedy/Jim%20and%20the%20Orders/solution.py)|
-||[Sherlock and Array](https://www.hackerrank.com/challenges/sherlock-and-array/problem)|Easy|[View](Algorithms/Search/Sherlock%20and%20Array/solution.cpp)|||
-||[Ice Cream Parlor](https://www.hackerrank.com/challenges/icecream-parlor/problem)|Easy|[View](Algorithms/Search/Ice%20Cream%20Parlor/solution.cpp)|||
-||[Missing Numbers](https://www.hackerrank.com/challenges/missing-numbers/problem)|Easy|[View](Algorithms/Search/Missing%20Numbers/solution.cpp)|||
+||[Sherlock and Array](https://www.hackerrank.com/challenges/sherlock-and-array/problem)|Easy|[View](Algorithms/Search/Sherlock%20and%20Array/solution.cpp)|[View](Algorithms/Search/Sherlock%20and%20Array/solution.java)||
+||[Ice Cream Parlor](https://www.hackerrank.com/challenges/icecream-parlor/problem)|Easy|[View](Algorithms/Search/Ice%20Cream%20Parlor/solution.cpp)|[View](Algorithms/Search/Ice%20Cream%20Parlor/solution.java)||
+||[Missing Numbers](https://www.hackerrank.com/challenges/missing-numbers/problem)|Easy|[View](Algorithms/Search/Missing%20Numbers/solution.cpp)|[View](Algorithms/Search/Missing%20Numbers/solution.java)||
 ||[HackerRank in a String!](https://www.hackerrank.com/challenges/hackerrank-in-a-string/problem)|Easy|[View](Algorithms/Strings/HackerRank%20in%20a%20String!/solution.cpp)|||
 ||[Funny String](https://www.hackerrank.com/challenges/funny-string/problem)|Easy|[View](Algorithms/Strings/Funny%20String/solution.cpp)|||
 ||[Gemstones](https://www.hackerrank.com/challenges/gem-stones/problem)|Easy|[View](Algorithms/Strings/Gemstones/solution.cpp)|||