Programming Throwdown cover image

Hash Maps

Programming Throwdown

00:00

Is There a Hash Table in an Interview?

In good interviews, I think they're actually hoping you don't know the answer because they don't care. There's a class of ones that you can narrow in on and how to structure this problem. The idea here is if you know up front all the items you're going to hash, say, 397 of them,. Then you make exactly 397 buckets and you find the hash function which one to one maps your input keys with zero collisions.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app