Patterns · hard

48. Simple Bloom Filter

Check if an item might be in a set using a bitmask.

Implement `add(filter, val)` and `mightContain(filter, val)` using `val % 8` bit.

Required in your answer: 1 << (v % 8)&

Runs in a sandboxed worker

function add(f, v) { f |= (1 << (v % 8)); return f; }
function mightContain(f, v) { return (f & (1 << (v % 8))) !== 0; }

Output appears here.