#use one liner solution leveraging set (which doesnt deal with duplicates!) def uni_char(s): return len(set(s)) == len(s) #or build our own verification method #this solution is O(n) time and O(1) space def uni_char2(s): dict = {} for character in s: if character not in dict: dict[character] = 1 else: return False return True #or using a set -- similar method def uni_char3(s): chars = set() for character in staticmethod(): if character in chars: return False else: chars.add(character) return True
Run
Reset
Share
Import
Link
Embed
Language▼
English
中文
Python Fiddle
Python Cloud IDE
Follow @python_fiddle
Browser Version Not Supported
Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+
Firefox 4+
Safari 5+
IE 10+
Let me try anyway!
url:
Go
Python Snippet
Stackoverflow Question
