Question d’entretien chez Adobe
reversing the linked list, and implementing queue using two stacks
Réponse à la question d'entretien
Utilisateur anonyme
23 août 2023
Both of them are standard questions. I reversed linked list using two pointers, one for previous and one for current. And implemented queue using two stacks in O(n) update time