FAQ: Hash Maps: Conceptual - Hash Functions

This community-built FAQ covers the “Hash Functions” exercise from the lesson “Hash Maps: Conceptual”.

Paths and Courses
This exercise can be found in the following Codecademy content:

Computer Science

Complex Data Structures

FAQs on the exercise Hash Functions

There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply (reply) below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head here.

Looking for motivation to keep learning? Join our wider discussions.

Learn more about how to use this guide.

Found a bug? Report it!

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

Why is a Hash Map better than a dictionary?

It feels like we’re losing a lot of functionality and information and gaining only compression. Is that right? There must be better ways to compress information.

Simple answer appears to be that it is not better or worse, but the same.

2 Likes

when I was playing around the hash function interface. i see that the hash index generated can be equal to the array length. how is it possible. if the array length is 10 that means the biggest index it has is 9, but the hash function can generate a index as 10. would in it be overflowing? (which is what hash function guarantees not to do)?