Question d’entretien chez Quotient
1)Two Sum 2)Longest Substring Without Repeating Characters
Réponse à la question d'entretien
Utilisateur anonyme
20 août 2020
For two sum they were looking for at least 2 approaches and for the second one they were selected candidates who solved the problem using Sliding Window Approach.