Longest substring with unique characters

longest_substring_with_unique_characters.py

class Solution(object):

    def solve(self, s):

        start = 0
        end = 1
        max_start = 0
        max_end = 0

        map = {}
        map[s[0]] = 0

        for i in range(1, len(s)):

            if map.get(s[i]) is not None and map.get(s[i]) >= start:
                index = map.get(s[i])
                temp_len = index - start + 1

                max_len = max_end - max_start + 1

                if temp_len > max_len:
                    max_start = start
                    max_end = index

                start = index + 1

            map[s[i]] = i

        end = len(s) - 1
        if end - start + 1 > max_end - max_start + 1:
            max_start = start
            max_end = end

        return s[max_start:max_end+1]


if __name__ == "__main__":

    s = 'abbccde'
    ans = Solution().solve(s)
    print(ans)