There's the typical interview question about how to create a distributed and scalable URL shortener. One of the issues is to know if a URL was shortened already or not. There's a special data structure that tells you if no or maybe. So it can have negatives or false positives but at least you know it wasn't calculated and you spare the visit do the database. The question is: what's the name of that structure? I forgot it and searched a lot but can't find it. Thanks!

  • 2
    $\begingroup$ Bloom filter... $\endgroup$ – Eugene Jul 4 '19 at 7:40
  • $\begingroup$ That one! Thanks! $\endgroup$ – Luís Soares Jul 4 '19 at 7:41

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.