Personal Brand: Week 3

Hash Maps

Photo by Steve Johnson on Unsplash
  • Separate chaining: Each array index stores another data structure such as a linked list, which stores all values for multiple keys that hash to the same index in the array.
  • Open addressing: We stick to the array as our underlying data structure, but when a collision happens, we continue looking for a new index to save the data. Commonly, a method called probing is used, it means continuing to find new array indices in a fixed sequence until an empty index is found.


Photo by Ludde Lorentz on Unsplash
Photo by Kelly Sikkema on Unsplash



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
Eduardo Ahumada

Eduardo Ahumada


Engineer looking to help and contribute. Learning about Software development and Computer Science.