as the load factor approaches we need to grow the table in factwe should do it before it gets there in order to avoid gets becoming too slow value of may be good value in which to grow the table the next question is how much to grow the table by one strategy would be to simply double the size of the table open addressing the collision resolution mechanism we used in our examplelinear probingis an example of an open addressing strategy linear probing is really simple since we use fixed interval between our probes there are other open addressing strategies as well but they all share the idea that there is an array of slots when we want to insert keywe check whether the slot already has an item or not if it doeswe look for the next available slot if we have hash table that contains slotsthen is the maximum number of elements in that hash moreoveras the load factor increasesit will take longer to find the insertion point for the new element because of these limitationswe may prefer to use different strategy to resolve collisionssuch as chaining chaining chaining is strategy for resolving conflicts and avoiding the limit to the number of elements in hash table in chainingthe slots in the hash table are initialized with empty lists