Pregunta de entrevista de Evernorth(VT)
// find the largest substring with only one repeating character // With complexity not greater than n*logn (function largestSubstring(_data){ })("sdhajgfhjgasdhgflgasdhjflasdhjfglhlhasdhjg")
// find the largest substring with only one repeating character // With complexity not greater than n*logn (function largestSubstring(_data){ })("sdhajgfhjgasdhgflgasdhjflasdhjfglhlhasdhjg")