Question d’entretien chez Apple

How will you implement sets and the intersection operation? Complexity?

Réponses aux questions d'entretien

Utilisateur anonyme

19 sept. 2011

I suggested to implement sets using self-balanced binary trees, although I can be done (dunno if in a more efficient way) with hashmaps.

Utilisateur anonyme

2 déc. 2018

self-balanced binary trees is not a good choice as you're assuming the content of the set are comparable.