nearest pallindrone Hackerrank question
Answer plzz....
Answers
Answered by
1
There will always be at least one palindrome which can be formed with the letters of the given string. Input: The first line contains the number of test cases T. Output: Constraints: Sample Input: 4 b bb abb cbaabbb. Sample Output: 0.0000 0.0000 3.0000 59.3380.
Similar questions