Dictionaries and Maps hackerrank problem (javaScript)-CodePudding

I tried to solve this problem in HackerRank and I passed the first case only and all the other cases were failures. So please, I want to help.

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 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 queried, print the associated entry from your phone book on a new line in the form name=phoneNumber; if an entry for 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, , denoting the number of entries in the phone book. Each of the subsequent lines describes an entry in the form of space-separated values on a single line. The first value is a friend's name, and the second value is an -digit phone number. After the lines of phone book entries, there are an unknown number of lines of queries. Each line (query) contains a 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 ≤ 10^5

1 ≤ queries ≤ 10^5

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 Code

function processData(input) {
    const number = parseInt(input[0])
    if(number >= 1 && number <= 100000) {
        const allData = input.split('\n')
        const contactData = allData.splice(0, number   1)
        queries = [...allData]
        const phoneBook = new Map()
       
       for(let i = 0; i < contactData.length -1 ; i  ) {
           splitContact = contactData[i   1].split(' ')
           phoneBook.set(splitContact[0], splitContact[1])
       }
       
        if(1 <= queries.length && queries.length <= 100000) {
            queries.filter((key) => {
            if(phoneBook.has(key)) {
                console.log(key   '='  phoneBook.get(key))
            } else {
                console.log('Not found')
            }
        })
        }
    } 
}

problem link https://www.hackerrank.com/challenges/30-dictionaries-and-maps/problem?isFullScreen=true

CodePudding user response：

const input = `3
sam 99912222
tom 11122222
harry 12299933
sam
edward
harry`;

function processData(input) {
    // Split the input into lines
    let allLines = input.split('\n');
    
    // Remove the first element from lines as the number of contacts
    const n = parseInt(allLines.shift());
    
    // Remove n number of lines from the lines as contacts
    const contactData = allLines.splice(0, n);
    
    // Transform contact lines into a phone book
    const phoneBook = new Map(contactData.map((contact) => contact.split(' ')));
    
    // The only thing left in lines is queries, iterate over each of them
    // and print the result
    allLines.forEach(query => {
      const queryResult = phoneBook.get(query) ? `${query}=${phoneBook.get(query)}` : 'Not found';
      console.log(queryResult);
    });
}

processData(input);