Pergunta de entrevista da empresa Clickr Media

How would you find the longest non-repeating substring of a character sequence?