vivekpatani

################
PUT
################

################
Run #1
################
Summary:
  Total:	67.9173 secs.
  Slowest:	0.0385 secs.

vivekpatani

################
PUT
################

################
Run #1
################
Summary:
  Total:	62.2255 secs.
  Slowest:	0.0467 secs.

vivekpatani

###############################################
Base Line #1
###############################################
❯ ./benchmark put
 10000 / 10000 Boooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo! 100.00% 1m5s

Summary:
  Total:	65.5507 secs.
  Slowest:	0.0357 secs.
  Fastest:	0.0003 secs.

vivekpatani

import java.util.HashMap;
import java.util.Map;

/*
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.