Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1147. 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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.