dariodip

from bloom_filter import BloomFilter

def find_duplicate_bf(a: list, bf_prob: float=0.5):
  bf = BloomFilter(len(a), bf_prob)

  for (i, el) in enumerate(a):
    if bf.check(el):    # element is in bloom filter
      for j in range(i):  # check the previous elements
        if a[j] == el:
          return el