Skip to content

Latest commit

 

History

History
35 lines (25 loc) · 929 Bytes

isograms.md

File metadata and controls

35 lines (25 loc) · 929 Bytes

Isograms 7 Kyu

LINK TO THE KATA - STRINGS FUNDAMENTALS

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)

isIsogram "Dermatoglyphics" = true
isIsogram "moose" = false
isIsogram "aba" = false

Solution

const isIsogram = str => {
  const sortArr = str.toLowerCase().split('').sort()

  for (let i = 0; i < sortArr.length; i++) {
    if (sortArr[i] === sortArr[i + 1]) return false
  }

  return true
}