CC1.1

UniqueChar.py

# idea: sort the string such that same characters sit together, then traverse the string one by one
# time complexity: O(NlogN)? depends on sorting alg.
# space complexity: O(1)


class Solution:
    def UniqueChar(self, string):
        if string == '':
            return True

        string = sorted(string)
        prev = string[0]
        for char in string[1:]:
            if char == prev:
                return False

            prev = char

        return True

Sort it first, terrific idea!