Created
September 3, 2023 11:06
-
-
Save ChousinRahit/576867dcfe35c4f3b199283fa53c27a2 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Find the Unique Letters | |
// Create a function that takes a string and returns an array of the letters that occur only once. | |
// findLetters("monopoly") ➞ ["m", "n", "p", "l", "y"] | |
// findLetters("balloon") ➞ ["b", "a", "n"] | |
// findLetters("analysis") ➞ ["n", "l", "y", "i"] | |
// Notes | |
// 1 - The final array should not include letters that appear more than once in the string. | |
// 2 - Return the letters in the sequence they were originally in, do not sort them. | |
// 3 - All letters will be in lowercase. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment