Java Map HackerRank Solution
You are given a phone book that consists of people’s names and their phone number. After that you will be given some person’s name as query. For each query, print the phone number of that person.
Input Format
The first line will have an integer n denoting the number of entries in the phone book. Each entry consists of two lines: a name and the corresponding phone number.
After these, there will be some queries. Each query will contain a person’s name. Read the queries until end-of-file.
Constraints:
A person’s name consists of only lower-case English letters and it may be in the format ‘first-name last-name’ or in the format ‘first-name’. Each phone number has exactly 8 digits without any leading zeros.
1<=n<=100000
1<=Query<=100000
Output Format
For each case, print “Not found” if the person has no entry in the phone book. Otherwise, print the person’s name and phone number. See sample output for the exact format.
To make the problem easier, we provided a portion of the code in the editor. You can either complete that code or write completely on your own.
Sample Input
3 uncle sam 99912222 tom 11122222 harry 12299933 uncle sam uncle tom harry
Sample Output
uncle sam=99912222 Not found harry=12299933
Code Solution:
//Java Map HackerRank Solution
//Complete this code or write your own from scratch
import java.util.*;
import java.io.*;
class Solution{
public static void main(String []argh)
{
Scanner in = new Scanner(System.in);
int n=in.nextInt();
in.nextLine();
HashMap<String, Integer> hm = new HashMap<String, Integer>();
for(int i=0;i<n;i++)
{
String name=in.nextLine();
int phone=in.nextInt();
hm.put(name, phone);
in.nextLine();
}
while(in.hasNext())
{
String s=in.nextLine();
try{
int temp = hm.get(s);
System.out.println(s+"="+temp);
}catch(NullPointerException e){
System.out.println("Not found");
}
}
}
}
//Java Map HackerRank Solution
Disclaimer: This problem is originally created and published by HackerRank, we only provide solutions to this problem. Hence, doesn’t guarantee the truthfulness of the problem. This is only for information purposes.
