hardDynamic ProgrammingGreedyHash FunctionRolling HashStringTwo Pointers 0 views
Longest Chunked Palindrome Decomposition
You are given a string text.
You are given a string text. You should split it to k substrings (subtext1, subtext2, ..., subtextk) such that:
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)(tep)(za)(pre)(a)(nt)(a)".
Constraints
- 1 <= text.length <= 1000
- text consists only of lowercase English characters.
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.