Question d’entretien chez Saviynt

3. Longest Substring Without Repeating Characters