7. Connecting the dots — Big O and Hash Table Data Structure

Hashing
Collisions mapping to the same spot in memory

Handling Collisions:

Linear probing where items are placed when an empty slot is found
Separate chaining using arrays and linked list

Output:

Output of the above code

Other related articles:

References:

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store