Given a string of lowercase English letters, count the ways to add one letter to it so that the result is a permutation of some palindrome.
Unlock detailed company stats for this questionUpgrade
Community answers
No answers contributed by the community yet.
Related questions
Given a string of lowercase letters, count the substrings made of one letter repeated, counting substrings at different positions separately.A substring is balanced when every letter in it appears the same number of times. Given a string of lowercase letters, find the length of the longest balanced substring.Related courses

Course

