Here’s my JS implementation using .reduce() :) :
const isIsogram = word => { word = word.toLowerCase().split(“”) const result = word.reduce((accum, letter) => { !accum.includes(letter) && accum.push(letter); return accum; }, []); return result.length === word.length; }
Hindsight, @savagepixie ’s answer using sets was much better and more efficient! Set theory is always better in situations like this :)
To be fair, Set usually isn't my first thought when solving problems. It's one of those things I kinda know are there but don't use that often.
Set
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Here’s my JS implementation using .reduce() :) :
Hindsight, @savagepixie ’s answer using sets was much better and more efficient! Set theory is always better in situations like this :)
To be fair,
Setusually isn't my first thought when solving problems. It's one of those things I kinda know are there but don't use that often.