Palindromic Anagrams Java Coding Challenge | Edabit | How'd You Code That?

Palindromic Anagrams

Palindrome Descendant Java Coding Challenge | How'd You Code That? https://youtu.be/xn0yUBLx16c

Anagram Java Coding Challenge | How'd You Code That?
https://youtu.be/HqDPH9uvOAM

Almost Palindrome Java Coding Challenge | How'd You Code That?https://youtu.be/shbBaPKsgl4

Can the sequence of characters “rearcac" be rearranged to form a palindrome?

Without having to evaluate each permutation of the sequence (which we’ll cover in another video), my solution focuses on one particular characteristic of all palindromes.

All palindromes have, at most, 1 unique character amongst its character sequence.

Take, “noon”, for example. It has zero unique characters. Or, the word, “Madam”, it has 1 unique character. If a word, or sequence of characters, has more than 1 unique character, it cannot form a palindrome.

Using that logic, I can solve this problem with a hashset, containing Characters, named: set, and a primitive integer, named: results.
I attempt to insert each character in the incoming string into the hashset. If the add operation on the set is successful, indicating a duplicate does not exist, I increment the results variable by one. Otherwise, when the add operation on the set is not successful, indicating the character already exists, the results variable is decremented by one.

So, when your loop completes evaluating all the characters in the incoming string, if the results variable is greater than 1, false is returned to the caller; other, true is returned.

Song: Sunshine - Ikson (Vlog No Copyright Music)
Music promoted by Vlog No Copyright Music.
https://soundcloud.com/ikson