A map is a data structure that provides an unordered collection of key/value pairs. Maps are used to look up a value by its associated key. You store values ​​in the map based on a key.

A map is implemented using a hash table, which provides faster lookups on the data element and you can easily retrieve a value by providing the key.

Maps are unordered collections and there is no way to predict the order in which key/value pairs will be returned. Each iteration in a map can return a different order.

//  key    value
map[string]int