This question is revolved around the testing of a well-known chef Gordan Ramsay analytical skill the chef prefers the strings but prefers palindromic strings. Today he found an old rope in his garage....

Extracted text: This question is revolved around the testing of a well-known chef Gordan Ramsay analytical skill the chef prefers the strings but prefers palindromic strings. Today he found an old rope in his garage. The string is so old that some of its characters have run out and are now unknown. The characters that end in the string are represented by '.' and some letters are lower Latin alphabets i.e. ['a' - 'z']. A palindrome-loving chef has decided to create the smallest named palindrome by filling in each finished letter ('.') In a small Latin alphabet. Can you help her finish the job by providing the C++ program for that? Example Input: 3 a.ba cb.bc Output: a.babba cbabc -1