HR Hash Tables: Ice Cream Parlor - HackerRank Cracking the Coding Interview Challenges

https://www.hackerrank.com/challenges/ctci-ice-cream-parlor/problem

	import java.io.*;
	import java.util.*;
	import java.text.*;
	import java.math.*;
	import java.util.regex.*;
	public class Solution {
	/**
	* @param arr
	* @param money
	*/
	static void solve(int[] arr, int money) {
	// Complete this function
	if (arr == null || arr.length < 1) {
	System.out.println(-1 + " " + -1);
	return;
	}
	// core logic
	HashMap<Integer, Integer> hashMap = new HashMap<>();
	for (int i = 0; i < arr.length; i++) {
	if (arr[i] < money) {
	if (hashMap.containsKey(money - arr[i])) {
	int index = hashMap.get(money - arr[i]);
	System.out.println((index + 1) + " " + (i + 1));
	return;
	}
	if (!hashMap.containsKey(arr[i])) {
	hashMap.put(arr[i], i);
	}
	}
	}
	}
	public static void main(String[] args) {
	Scanner in = new Scanner(System.in);
	int t = in.nextInt();
	for(int a0 = 0; a0 < t; a0++){
	int money = in.nextInt();
	int n = in.nextInt();
	int[] arr = new int[n];
	for(int arr_i = 0; arr_i < n; arr_i++){
	arr[arr_i] = in.nextInt();
	}
	solve(arr, money);
	}
	in.close();
	}
	}

view raw HR Hash Tables: Ice Cream Parlor - HackerRank Cracking the Coding Interview Challenges.java hosted with ❤ by GitHub