Triple Palindrome Partition

Given a string of lowercase characters, determine whether it is possible to divide the string into exactly three contiguous, non-empty segments such that each segment reads the same forwards and backwards (forming a palindrome).

A palindrome is defined as a sequence of characters that is identical when read from left to right or from right to left. Examples include "a", "aa", "aba", "abcba", and "racecar".

Your task is to analyze the input string and return true if such a triple-partition exists where all three resulting substrings are palindromes, otherwise return false.

For instance, the string "abcbdd" can be split into "a" + "bcb" + "dd", where "a" is a single-character palindrome, "bcb" is a three-character palindrome, and "dd" is a two-character palindrome. Thus, a valid partition exists.

Note that you must use every character in the string exactly once, and each of the three parts must contain at least one character.