Day 8: Dictionaries and Maps

Day 8: Dictionaries and Maps

Objective

Today, we’re learning about Key-Value pair mappings using a Map or Dictionary data structure. Check out the Tutorial tab for learning materials and an instructional video!

Task

Given n names and phone numbers, assemble a phone book that maps friends’ names to their respective phone numbers. You will then be given an unknown number of names to query your phone book for. For each name queried, print the associated entry from your phone book on a new line in the form name=phoneNumber; if an entry for name is not found, print Not found instead.

Note: Your phone book should be a Dictionary/Map/HashMap data structure.

Input Format

The first line contains an integer, n, denoting the number of entries in the phone book.
Each of the n subsequent lines describes an entry in the form of 2 space-separated values on a single line. The first value is a friend’s name, and the second value is an 8-digit phone number.

After the n lines of phone book entries, there are an unknown number of lines of queries. Each line (query) contains a name to look up, and you must continue reading lines until there is no more input.

Note: Names consist of lowercase English alphabetic letters and are first names only.

Constraints

  • 1 <= n <= 105
  • 1 <= queries <= 105

Output Format

On a new line for each query, print Not found if the name has no corresponding entry in the phone book; otherwise, print the full name and phoneNumber in the format name=phoneNumber.

Sample Input

1
2
3
4
5
6
7
3
sam 99912222
tom 11122222
harry 12299933
sam
edward
harry

Sample Output

1
2
3
sam=99912222
Not found
harry=12299933

Explanation

We add the following n = 3 (Key,Value) pairs to our map so it looks like this:

phoneBook = {(sam, 99912222), (tom, 11122222), (harry, 12299933)}

We then process each query and print key=value if the queried key is found in the map; otherwise, we print Not found.

Query 0: sam
Sam is one of the keys in our dictionary, so we print sam=99912222.

Query 1: edward
Edward is not one of the keys in our dictionary, so we print Not found.

Query 2: harry
Harry is one of the keys in our dictionary, so we print harry=12299933.




Solutions

Solution 1

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

function processData(input) {
//Enter your code here
const { phoneBook, queries } = input.split('\n').reduce((target, item, index) => {
let total = !index ? item : target['total'];
let { 0: key, 1: value } = item.split(' ');

!index
? (target['total'] = total)
: (
index <= total
? (target['phoneBook'][key] = value)
: target['queries'].push(item)
)

return target;
}, { total: 0, phoneBook: [], queries: [] });

queries.forEach((query) => {
let value = phoneBook[String(query)];

console.log(value ? `${query}=${value}` : 'Not found');
});
}

Solution 2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

function processData(input) {
//Enter your code here
const inputData = input.split('\n');
const dataLength = Number(inputData.shift());
const phoneBook = new Map();
const queryData = inputData.reduce((target, item, index) => {
index < dataLength ? phoneBook.set(item.split(' ')[0], item.split(' ')[1]) : target.push(item);

return target;
}, []);

queryData.forEach((val, index) => {
console.log(phoneBook.get(val) ? `${val}=${phoneBook.get(val)}` : 'Not found');
})
}

Solution 3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
function processData(input) {
//Enter your code here
const splitInput = input.split("\n");
const phoneBookSize = +splitInput[0];
const inputValue = splitInput.slice(phoneBookSize + 1);
const temp = splitInput.slice(1, phoneBookSize + 1).map(list => {
let result = {
name: list.split(" ")[0],
phoneNumber: list.split(" ")[1]
}
return result;
});

let phoneBook = [];
for (let list of temp) {
phoneBook[list.name] = list.phoneNumber;
}

for (let name of inputValue) {
if (phoneBook[name]) {
console.log(`${name}=${phoneBook[name]}`);
} else {
console.log('Not found')
}
}
}
Buy Me A Coffee

Comments

10Days of JS 30Days of Code Algorithm Android Debug Bridge Android Debugging Basic for Web Blog Browsers Chrome으로 Android Debugging 방법 Correctness and the Loop Invariant hackerrank solution in javascript Debug Tools Development Environment in MacOS ES6 Front-End Funny String of Algorithms hackerrank solution in javascript Funny String of Algorithms hackerrank solution in typescript Generator Github Page with Hexo Github Pages HackerRank HackerRank in a String of Algorithms hackerrank solution in javascript HackerRank in a String of Algorithms hackerrank solution in typescript Hexo Hexo Icarus theme Hexo 블로그 만들기 Hexo+Github How Browsers work Insertion Sort - Part 1 hackerrank solution in javascript Insertion Sort - Part 2 hackerrank solution in javascript JS Library JavaScript Level1 Level2 Loops MacOS 개발 환경 설정하기 Mobile web Debugging Node.js Pangrams of Algorithms hackerrank solution in javascript Pangrams of Algorithms hackerrank solution in typescript Problem Solving Programmers Quicksort 1 - Partition hackerrank solution in javascript React RoadMap Running Time of Algorithms hackerrank solution in javascript Safari Debugging Safari Technology Preview Settings Sorting String Strings Strong Password of Algorithms hackerrank solution in javascript TypeScript blog iPhone Safari Debugging 방법 insertion sort 모바일 웹 디버깅 아이폰 사파리를 디버깅하는 방법 안드로이드 디버그 브리지 안드로이드 디버깅하는 방법
Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×