leetcode/en/lcci/1.1/

[giscus[bot]]

leetcode/en/lcci/1.1/

LeetCode solutions in any programming language

https://doocs.github.io/leetcode/en/lcci/1.1/

[jumael99]

Hi! Without bit manipulation can you give some other easy solution?

[devmustafa03]

const isCheckingSimilarCharacter = (word) => {
const currentWord = new Set();

for (let char of word) {
    if (currentWord.has(char)) {
        return false;
    }
    currentWord.add(char);
}

return true;

};

This is for javascript