Suppose you have two hash tables, each with n elements. To find the elements that are in both tables, you iterate over the first table, and for each element, check whether it is contained in the second table. This is an

$$

$($

$$

$2$

$)$

O$($n

$2$

$)$ operation.