Longest Chunked Palindrome Decomposition

Partition a string into the maximum number of non-empty contiguous chunks such that the sequence of chunks is symmetric (chunk i equals chunk k−i+1 for all i). This reduces to repeatedly matching equal prefix/suffix substrings (solvable with two‑pointer/DP or rolling hashes) for strings up to length 1000.