# Hacker Rank Solution For Day 8: Dictionaries and Maps

Problem:- Write a Hackerrank Solution For Day 8: Dictionaries and Maps or Hacker Rank Solution Program In C++ For " Day 8: Dictionaries and Maps " or Hackerrank 30 days of code Java Solution: Day 8: Dictionaries and Maps solution or Hackerrank solution for 30 Days of Code Challenges or Hackerrank 30 days of code Java Solution: Day 8: Dictionaries and Maps, or C/C++ Logic & Problem Solving: Day 8: Dictionaries and Maps.

Logic:- Day 8: Dictionaries and Maps as we know that Dictionaries is a collection of data(variety of data). So for this problem, we can take an example of the phone book. Phonebook consists of various phone data line name, address and phone number, we are considering only phone name and number. We can solve this problem by considering a phone book. See the below explanation.

Explanation:- Suppose we have a phone book contain a name and phone number.

1. Ghanendra 9999999999
2. Prashant 8888888888
3. Pramod 7777777777
4. John 9898989898
5. ............................
6. ............................
n.......... So On.

Now if a person wants a number of particular people then he will enter a person name or multiple person names. Now the first person came and enter the name of the desired people.

Person 1:-

Enter name = Ghanendra
Output => Ghanendra = 9999999999

Person 2:-

Enter name = Prashant
Output => Prashant = 8888888888

Person 3:-

Enter name = John
Output => John = 9898989898

Person 4:- Now person 4 came and enter a name in Smith, as we know that Smith is not in stored in out dictionary then our program print ' Not found '. See the below example.

Enter name = Smith

Person 1:- now again if person 1 enters the name Pramod than it will print the Pramod details if exist.

Enter name = Pramod
Output => Pramod = 7777777777

I hope you got the problem statement and logic of problem, Now we can solve the problem by implementing our own function and logic or we can use the existing function. Here I am using existing function that will help me to save the time.

Tip 1:- Always try to implement the own function and logic this will help you to solve and building a logic, But you have to know that how to use the predefined function.

Copy the colored code and paste it into hacker rank editor. If you have any query feel free to share with me, and if you like my work please share, comments and subscribe for our new and latest post related to programming this will help you update all about new post this Article.

Solution:-

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<map>

using namespace std;
int main()
{
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int n;
string name;
long num;
cin >> n;
cin.ignore();
map <string,long> pbook;
for (int i=0;i<n;i++)
{
cin >> name;
cin >> num;
pbook[name] = num;
}
while(cin>>name)
{
if (pbook.find(name)!=pbook.end())
cout<<name<<"="<<pbook.find(name)->second<<endl;
else
}
return 0;
}

Output:-

You May Also Like:-

4. Hackerrank Solution For Day 12: Inheritance

5. Hackerrank Solution For Day 13: Abstract Classes

1. ahh this is not working