5 ms·

Expected

• marcosdumay 6d ago
  Nowadays I expected an opaque dictionary to be amortized O(1). Granted, one can technically call that O(log(n)), but that's not a helpful categorization.
  • emil-lp 6d ago
    You cannot guarantee that from a hash map since an adversary who knows the hash function (unless it's cryptographic) could game the data structure to their advantage.