Skip to content

Commit 1f1ec45

Browse files
authored
Create HashTablesIceCreamParlor.java
1 parent 6e185e2 commit 1f1ec45

File tree

1 file changed

+39
-0
lines changed

1 file changed

+39
-0
lines changed

HashTablesIceCreamParlor.java

+39
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
package com.javaaid.hackerrank.solutions.algorithms.search;
2+
3+
import java.util.HashMap;
4+
import java.util.Map;
5+
import java.util.Scanner;
6+
7+
/**
8+
* @author Kanahaiya Gupta
9+
*
10+
*/
11+
public class HashTablesIceCreamParlor {
12+
static void solve(int[] arr, int money) {
13+
Map<Integer,Integer> map=new HashMap<Integer,Integer>();
14+
int len=arr.length;
15+
for(int i=1;i<=len;i++){
16+
map.put(arr[i-1], i);
17+
}
18+
for(int i=1;i<=len;i++){
19+
if(map.containsKey(arr[i-1]) && map.containsKey(Math.abs(money-arr[i-1]))) {
20+
System.out.println(i+" "+map.get(Math.abs(money-arr[i-1])));
21+
break;
22+
}
23+
}
24+
}
25+
public static void main(String[] args) {
26+
Scanner in = new Scanner(System.in);
27+
int t = in.nextInt();
28+
for (int a0 = 0; a0 < t; a0++) {
29+
int money = in.nextInt();
30+
int n = in.nextInt();
31+
int[] arr = new int[n];
32+
for (int arr_i = 0; arr_i < n; arr_i++) {
33+
arr[arr_i] = in.nextInt();
34+
}
35+
solve(arr, money);
36+
}
37+
in.close();
38+
}
39+
}

0 commit comments

Comments
 (0)