Challenge overview
Hello and welcome to the challenge!
Write a code which detects if the given string is an isogram. Isograms are words without any repeating letters (consecutive or non-consecutive). Assume that all given strings consist of only letters. Ignore letter case (liKe tHiS).
Have fun and good luck! :)
