Question: what is the internal data structure used to implement hashmap?
Answer: HashMaps use an array in the background. Each element in the array is another data structure (usually a linked list or binary search tree). The HashMap uses a function on the key to determine where to place the key's value in the array.