Leetcode 3503. Longest Palindrome After Substring Concatenation I

Given two short strings s and t, pick any substring from s and any substring from t, concatenate them in order, and return the maximum length of a palindrome you can form. The key challenge is matching characters across the s/t concatenation boundary, often tackled by expanding around possible centers that straddle the two strings or by checking all substring pairs.