# FAQ: Hash Maps: Conceptual - Open Addressing: Linear Probing

This community-built FAQ covers the “Open Addressing: Linear Probing” exercise from the lesson “Hash Maps: Conceptual”.

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

## FAQs on the exercise Open Addressing: Linear Probing

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 () 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.

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

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!

“When do you think we would use probing over other strategies?”

Would you use probing when you have a known total amount of possible keys? That way, you aren’t wasting array space, and you have a worst case computation time of a linked list (when all the hash buckets are full, and your hash function computes an index that leads to the longest possible ‘probing’).

1 Like

So basically we can only use probing when we know the array size is more than the no. of keys to be inputted or else we wont be able to input all the keys as the array would be full right?

hello lovely people <3 can someone simply and shortly explain the concept of linear probing?(when, why) thank you!