Hashing interview questions

Implement a function that determines whether two strings are anagrams of each other.

Assign users to weighted experiment variants deterministically, with a traffic gate and independent buckets per experiment.

Build a Bloom filter — a compact probabilistic set that answers membership with no false negatives but possible false positives, using a bit array and several hash functions.

Evaluate feature flags with targeting rules and a deterministic percentage rollout that stays sticky per user.