Medium data structure and algorithm practice puzzle.
Given a Bloom filter's size, the bit positions each added key set, and the positions of a key you're checking, return true if the filter says it might be there. Set every bit for every added key. Then if all of the query's bits are set, it's probably there. If any bit is clear, it's definitely not. Probably yes, definitely no. That's the whole design.
Solve it three ways: snap the jigsaw pieces together, fill in the blanks, or type it from scratch against the tests. This one is free.
Every line of the solution comes with a note explaining why it is there, and a step by step replay shows the code running. At level 3, where you type it yourself, you can ask for an AI mock interview on this problem that ends with a hiring manager's scorecard.
Browse all 546 puzzles