Hello Programmers/Coders, Today we are going to share solutions of Programming problems of HackerRank of Programming Language Java . At Each Problem with Successful submission with all Test Cases Passed, you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.
In this post, you will find the solution for Java Map-HackerRank Problem. We are providing the correct and tested solutions of coding problems present on HackerRank. If you are not able to solve any problem, then you can take help from our Blog/website.
Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.
Introduction To Java
JAVA was developed by James Gosling at Sun Microsystems Inc in the year 1991, later acquired by Oracle Corporation. It is a simple programming language. Java makes writing, compiling, and debugging programming easy. It helps to create reusable code and modular programs.
Java is a class-based, object-oriented programming language and is designed to have as few implementation dependencies as possible. A general-purpose programming language made for developers to write once run anywhere that is compiled Java code can run on all platforms that support Java. Java applications are compiled to byte code that can run on any Java Virtual Machine. The syntax of Java is similar to c/c++.
Link for the Problem – Java Map- Hacker Rank Solution
Java Map- Hacker Rank Solution
Problem :
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 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.
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
Java Map- Hacker Rank Solution
import java.util.*; import java.io.*; class Solution{ public static void main(String []argh) { HashMap<String, Integer> hash = new HashMap<String, Integer>(); Scanner in = new Scanner(System.in); int n=in.nextInt(); in.nextLine(); for(int i=0;i<n;i++) { String name=in.nextLine(); int phone=in.nextInt(); hash.put(name, phone); in.nextLine(); } while(in.hasNext()) { String s=in.nextLine(); if (hash.containsKey(s)) { System.out.println(s + "=" + hash.get(s)); } else { System.out.println("Not found"); } } } }