Question d’entretien chez TORC Robotics
1) Find loop in Linked list
Réponse à la question d'entretien
Utilisateur anonyme
10 févr. 2020
You can use an hashmap to store each pointer as you move through. Although a better approach would be use the hare and tortoise algorithm since that gives O(N) time complexity and O(1) space complexity.