Question d’entretien chez Tripadvisor
2 sum.
Réponse à la question d'entretien
Utilisateur anonyme
25 févr. 2013
Firstly I said hash map. Then he ask me try not to take any additional space. Than I said that we can sort the list and use 2 pointers which gives O(n(logn)) time. He said it is good.
1