Question d’entretien chez Wednesday Solutions
Solve a problem to find the longest substring without repeating characters.
Réponse à la question d'entretien
Utilisateur anonyme
29 avr. 2025
I explained the sliding window technique to efficiently solve it with O(n) time complexity.