LeetCode //C - 1147. Longest Chunked Palindrome Decomposition
1147. Longest Chunked Palindrome Decomposition
You are given a string text. You should split it to k substrings $(subtext_1, subtext_2, …, subtext_k)$4 such that: subtextisubtext_isubtexti is a non-empty string.The concatenation of all the substrings i…
2026/7/16 23:52:31