Exploring a possible solution

We know that storing key-value mappings in two separate arrays has limitations and results in sub-optimal solutions, so we can look at a data structure explicitly designed to solve this problem. A hash table efficiently stores mapping between data and provides fast data access.

Real life example

A real-life example of such a data structure is a phone book directory with the phone numbers of all the residents in a city. The phone book lists the names in alphabetical order. Anyone can quickly jump to the page with a person's phone number just by looking at the index instead of linearly scanning the entire phonebook.