1616 - Split Two Strings to Make Palindrome\.

Medium

You are given two strings a and b of the same length. Choose an index and split both strings at the same index , splitting a into two strings: <code>a_prefix</code> and <code>a_suffix</code> where <code>a = a_prefix + a_suffix</code>, and splitting b into two strings: <code>b_prefix</code> and <code>b_suffix</code> where <code>b = b_prefix + b_suffix</code>. Check if <code>a_prefix + b_suffix</code> or <code>b_prefix + a_suffix</code> forms a palindrome.

When you split a string s into <code>s_prefix</code> and <code>s_suffix</code>, either <code>s_suffix</code> or <code>s_prefix</code> is allowed to be empty. For example, if s = "abc", then "" + "abc", "a" + "bc", "ab" + "c" , and "abc" + "" are valid splits.

Return true if it is possible to form a palindrome string, otherwise return false.

Notice that x + y denotes the concatenation of strings x and y.

Example 1:

Input: a = "x", b = "y"

Output: true Explaination: If either a or b are palindromes the answer is true since you can split in the following way:

a_prefix = "", a_suffix = "x"

b_prefix = "", b_suffix = "y"

Then, a_prefix + b_suffix = "" + "y" = "y", which is a palindrome.

Example 2:

Input: a = "xbdef", b = "xecab"

Output: false

Example 3:

Input: a = "ulacfd", b = "jizalu"

Output: true Explaination: Split them at index 3:

a_prefix = "ula", a_suffix = "cfd"

b_prefix = "jiz", b_suffix = "alu"

Then, a_prefix + b_suffix = "ula" + "alu" = "ulaalu", which is a palindrome.

Constraints:

• <code>1 <= a.length, b.length <= 10⁵</code>

• a.length == b.length

• a and b consist of lowercase English letters