Longest Chunked Palindrome Decomposition LeetCode solution in Python

1
# Runtime: 82 ms (Top 23.89%) | Memory: 13.9 MB (Top 78.76%)
2

3

4
class Solution:
5
    def longestDecomposition(self, text: str) -> int:
6
        left, right = 0, len(text) - 1
7
        sol, last_left = 0, 0
8
        a, b = deque(), deque()
9
        while right > left:
10
            a.append(text[left])
11
            b.appendleft(text[right])
12
            if a == b:
13
                sol += 2
14
                last_left = left
15
                a, b = deque(), deque()
16
            right -= 1
17
            left += 1
18
        if left == right or left > last_left + 1:
19
            sol += 1
20
        return max(sol, 1)