Question d’entretien chez Walgreens

"Longest Substring Without Repeating Characters" from Leetcode.