I was asked the following question in the online interview:\n\nGiven 2 strings \'A\' & \'B\', find whether it is possible to cut both strings at a common point such that\nconcatenating the first part of one string and the second part of the other string results in a palindrome. \n\n**Example 1:**\n**Input:** A = "abcdef" B = "xyzcba"\n**Output:** true -> as we can cut both the string from index 2 to get the palindromic string "abccba"\n\n**Example 2:**\n**Input:** A = "abcxxxdef" B = "abcabccba"\n**Output:** true -> as we can cut both the string from index 5 to get the palindromic string "abcxxxcba"\n\n**Follow up question:**\n\nInstead of cutting at the same point, you can now cut at different points (and\ndo the same operation of concatenating first part of one string with the second part of the other).\nWhat is the length of the longest palindrome that can be formed this way?

I was asked the following question in the online interview:\n\nGiven 2 strings \'A\' & \'B\', find whether it is possible to cut both strings at a common point 