We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. LinkedIn Placements
  4. Dictionaries and Maps
  5. Discussions

Dictionaries and Maps

Sort by

recency

|

48 Discussions

|

  • indrashekharcho1
     + 0 comments

    n=int(input()) phn_bk={} for i in range(n): entry=list(input().split(" ")) phn_bk.update({entry[0]:entry[1]}) while (1): try: qry=input() if qry in phn_bk: print(f"{qry}={phn_bk.get(qry)}") else: print("Not found") except (EOFError): break

  • jarturo301286
     + 0 comments

    Can anyone help me figure why all my test pass at submission yet I get a runtime error ? This is my code 

    # Enter your code here. Read input from STDIN. Print output to STDOUT
import sys
import math
import fileinput

n = input()
number = int(n)
inp = []
phonebook = {}

for line in fileinput.input():
    inp.append(line.split()) 


for i in range(number):
    phonebook.update({str(inp[i][0]):str(inp[i][1])})


for i in range(number, number + number):
    if phonebook.get(str(inp[i][0])) == None:
        print("Not found")
    else:
       print(inp[i][0] + "=" + phonebook.get(str(inp[i][0])))

  • roober_cruz
     + 0 comments
    # Enter your code here. Read input from STDIN. Print output to STDOUT
from collections import defaultdict

val = int(input())

dct = defaultdict(lambda: 0)

for q in range(val):
    name, phone = input().split()
    dct[name] = phone

for i in range(val):
    searchedName = input()
    if dct[searchedName] == 0:
        print("Not found")
    else:
        print(searchedName + '=' + dct[searchedName])

  • CS_1734810059
     + 0 comments

    Working Python Solution : n = int(input()) d = dict(input().split() for i in range(n)) while True: try: p = str(input()) if p not in d: print("Not found") else: print(p+"="+d[p]) except: break

  • deb_raj
     + 0 comments

    USING UNORDERD MAPS:

    include

    using namespace std; int main(){ int n,i,num; cin>>n; string name;

    unordered_map<string,int>pbook;
while(n--)
{
    cin>>name;
    cin>>num;
    pbook[name]=num;
} 
string sname;
while(cin>>sname){
     if(pbook.find(sname)==pbook.end())
       cout<<"Not found"<<endl;
    else 
      cout<<sname<<'='<<pbook[sname]<<endl;
}

    }