1147. Longest Chunked Palindrome Decomposition

Description

You are given a string text. You should split it to k substrings (subtext₁, subtext₂, ..., subtext_k) such that:

subtext_i is a non-empty string.
The concatenation of all the substrings is equal to text (i.e., subtext₁ + subtext₂ + ... + subtext_k == text).
subtext_i == subtext_{k - i + 1} for all valid values of i (i.e., 1 <= i <= k).

Return the largest possible value of k.

Example 1:

Input: text = "ghiabcdefhelloadamhelloabcdefghi"
Output: 7
Explanation: We can split the string on "(ghi)(abcdef)(hello)(adam)(hello)(abcdef)(ghi)".

Example 2:

Input: text = "merchant"
Output: 1
Explanation: We can split the string on "(merchant)".

Example 3:

Input: text = "antaprezatepzapreanta"
Output: 11
Explanation: We can split the string on "(a)(nt)(a)(pre)(za)(tpe)(za)(pre)(a)(nt)(a)".

Example 4:

Input: text = "aaa"
Output: 3
Explanation: We can split the string on "(a)(a)(a)".