Still Stuck on Day 8 of 30 Days Of Code Challenge (But I surrender and go with JS version ... for now)
Day 8: October 16, Wednesday
Today ‘s Progress: I am working through getting 30-days-of-code I’m still stuck in Day 8. Thoughts: While I could get past the timeout error using JS, Its not going to help me get through my problems with golang, but I cant keep grinding away on this 30 day thing on day 8. So I went with what I have been coding in the most JS.
Resources used:
- Github repo for 30 days of code
- HackerRank.com 30 days of code : Directories and Maps
- GoLang playground
- golangprograms.com
Objective
Work though the Problem with Your code did not execute within the time limitsⓘ!
The test case is here yielding proper results as shown in the Test case results the issue is it failed to execute fast enough for the environments time out.
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.
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
3
sam 99912222
tom 11122222
harry 12299933
sam
edward
harry
Sample Output
sam=99912222
Not found
harry=12299933
My Original golang Code
package main
import "fmt"
func main() {
//Enter your code here. Read input from STDIN. Print output to STDOUT
var n int
m := make(map[string]int)
// make map to store scanned data
fmt.Scan(&n)
//Scan test data
var name string
var number int
for i := 0; i < n; i++ {
fmt.Scan(&name)
fmt.Scan(&number)
m[name] = number
}
//Query for values
var query string
for {
_, err := fmt.Scanf("%s", &query)
if err != nil {
break
}
if value, ok := m[query]; ok {
fmt.Printf("%s=%d\n", query, value)
} else {
fmt.Println("Not found")
}
}
}
My JS Code
function processData(input) {
//Enter your code here
input = input.split('\n');
var n = parseInt(input[0]);
var phoneBook = [];
//Add values to the phoneBook dictionary.
for (var i = 0; i < n; i++){
var newinput = input[i+1];
newinput = newinput.split(' ');
phoneBook[newinput[0]] = newinput[1];
}
//Check if values are in dictionary.
for (var i = n+1; i < input.length; i++){
var num = (phoneBook[input[i]]);
if (num !== undefined) {
console.log(input[i]+'='+num);
} else {
console.log('Not found');
}
}
}
//end of my code
//below is given by the challange
process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
_input += input;
});
process.stdin.on("end", function () {
processData(_input);
});
Link(s) to work
- Working on my 30 days of Go on HackerRank.com.
Code is at https://github.com/Johnny2136/30-Days-of-Code.