Implement an intersection method for two lists. After showing a brute force method, I was asked to improve upon the method and analyze time complexity for both algorithms.

Question

Vinod · Accepted Answer

1. Traverse through the first list and put all items in a hash table. 
2. Traverse through the second list and try to find these items in the hash table created in step 1 -> Add all items found to the intersection list.

O(N) complexity.

Utilisateur anonyme · Answer

1. Convert both lists to hashsets
2. Find the intersection of the two hashsets
3. Convert this intersection back into a list

Goldman Sachs

Question d’entretien chez Goldman Sachs

Réponses aux questions d'entretien

Entreprises suivies

Recherche d’emplois