title: Why do we use linear probing in hash tables when there is separate chaining linked with lists?
body: <p>I recently learned about different methods to deal with collisions in hash tables and saw that the separate chaining with linked lists is always more time efficient than linear probing. For space efficiency, we allocate a predefined memory for linear probing which later on we might not use, but for separate chaining we use memory dynamically.</p>
  <p>Is separate chaining with linked list more efficient than linear probing? If so, why do we then use linear probing at all?</p>