count the occurrences of each character in both strings and then compare the counts.

the potential length of the palindrome is len(s) - odds_cnt + bool(odds_cnt)

sliding window - decrement the count of the character that is left behind i - len(p)

for each string in the given array, sort its characters and use the sorted string as a key to the hashmap