Why do we use linear probing in hash tables when there is separate chaining linked with lists?

Question

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 lin