7 kyu
Isograms
101,936 of 270,564chunjef
Description:
An isogram is a word that has no repeating letters, consecutive or non-consecutive. Implement a function that determines whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.
Example: (Input --> Output)
"Dermatoglyphics" --> true
"aba" --> false
"moOse" --> false (ignore letter case)
Strings
Fundamentals
Similar Kata:
Stats:
Created | Jan 17, 2015 |
Published | Jan 17, 2015 |
Warriors Trained | 480877 |
Total Skips | 41779 |
Total Code Submissions | 790860 |
Total Times Completed | 270564 |
Haskell Completions | 2559 |
JavaScript Completions | 101936 |
Python Completions | 97893 |
Ruby Completions | 7839 |
CoffeeScript Completions | 40 |
C# Completions | 15963 |
C++ Completions | 10760 |
Java Completions | 24089 |
PHP Completions | 5036 |
C Completions | 4365 |
TypeScript Completions | 4846 |
Julia Completions | 134 |
NASM Completions | 29 |
Crystal Completions | 21 |
COBOL Completions | 14 |
Factor Completions | 16 |
F# Completions | 47 |
Scala Completions | 151 |
Total Stars | 3042 |
% of votes with a positive feedback rating | 90% of 20979 |
Total "Very Satisfied" Votes | 17170 |
Total "Somewhat Satisfied" Votes | 3497 |
Total "Not Satisfied" Votes | 312 |