In computer science, an associative array, map, symbol table, or dictionary is an abstract data type composed of a collection of (key, value) pairs, such that each possible key appears at most once in the collection.
There are various implementations of this abstract data structure, such as, but not limited to:
This exercise asks student to create and maintain a map of highscores using strings as keys and integers as values
- Map
- Add key-values to maps
- Put values to a map
- Remove key-value pairs from a map
- Return formatted data from a map structure
| Track | Exercise | Changes |
|---|---|---|
| Elixir | maps | None |