Given a string, determine whether any permutation of it is a palindrome. For example, “tacocat” should return true, since it can be reversed and still spell “tacocat”. "daily" should return false, since there's no rearrangement that can form a palindrome. (Hint: In order to be a palindrome, the word, phrase, or sequence has to read the same backward as it does forward)
canBePalindrome(“tacocat”) // returns true
canBePalindrome("daily") // returns false
Here are the overall instructions for code challenges, if you need a reminder. Before you begin, fork and clone this repo and work through your solution in the included starter playground file. When you're done, Please make sure to save and push all your work, and submit a Pull Request. Don't forget tag your TL so they can review your submission!