JavaScript 🐲 challenges_2 ⚔️

Isograms

• 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.

Examples:

• "Dermatoglyphics" --> true
• "aba" --> false
• "moOse" --> false (ignore letter case)

Task URL

My solution:

function isIsogramOne(str) {

    let strLower = str.toLowerCase(); // convert to lowercase
    let charArr = strLower.split(''); // split into array 
    let result = []; // create empty array to store unique characters

    for (let i = 0; i < charArr.length; i++) { // loop through array
        if (result.indexOf(charArr[i]) === -1) { // if chraacter is not in array
            result.push(charArr[i]); // push character to array 
        }
    }
    return result.length === charArr.length;
}

Another solution:

function isIsogramTow(str) {
    return str.toLowerCase().split('').filter((item, index, array) =>
        array.indexOf(item) === index).length === str.length;
}

10 JavaScript Games to learn-Totally Cool & Fun 🚀✨🔥

🎥

Connect with Me 😊

🔗 Links

Comments

[Jon Randy 🎖️]

const isIsogram = str =>
  [...new Set([...str.toLowerCase()])].length == str.length

[Mahmoud EL-kariouny]

Excellent solution bro :)