Data Engineering, Spark, Data.
not. In other words, it can tell if an element probably (and not definitely) exists in a set or not. It is space efficient because it does not store the actual elements in it (like a Hash Map). The algorithm is based on a bit vector of size m and k independent and uniformly distributed hash