Palindrome Partitioning IV

Determine whether the string s can be split at two positions into three non-empty substrings that are all palindromes — equivalently, whether there exist two cut points making each segment a palindrome; note n ≤ 2000 so efficient palindrome checks (precomputation or center expansion) are needed.