FAQ: Hash Maps: Conceptual - Review

This community-built FAQ covers the “Review” 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 Review

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!

I think this section about Hash Maps needs to be reviews and possibly revised.
I found all of this content hard to read through.

For example:

There are different hash collision strategies. Two important ones are separate chaining, where each array index points to a different data structure, and open addressing, where a collision triggers a probing sequence to find where to store the value for a given key.

I wasn’t sure if it was just me but I ran them through Grammarly and it also reported that they were hard to read.
image

This paragraph is only 2 sentences and lots of commas. It is hard to distinguish where it addresses the 2 important collision strategies.

I think this can be resolved by:

  • To break up this paragraph and sperate the 2 strategies into bullet points to make them distinguishable from one another.
    or
  • It should be at least 3 sentences. First should be an intro to what topic it is going to reference, the second and third should be about the 2 different strategies.

Also for the pages with examples, I think it would be more effective if all the examples reflected the content more closely, specifically the hashing functions being used. The content talks about one hash function but the example a different one.

7 Likes

The quiz questions are not worded the greatest.
I also expected more question after 12 pages of content.

3 Likes