2369. Check if There is a Valid Partition For The Array

class Solution:
    def validPartition(self, nums: List[int]) -> bool:
        n = len(nums)
        dp = [False] * (n + 1)
        dp[0] = True
        for i in range(2, n + 1):
            if nums[i - 1] == nums[i - 2]:
                dp[i] = dp[i] or dp[i - 2]
            if i > 2 and nums[i - 1] == nums[i - 2] == nums[i - 3]:
                dp[i] = dp[i] or dp[i - 3]
            if (
                i > 2
                and nums[i - 1] - nums[i - 2] == 1
                and nums[i - 2] - nums[i - 3] == 1
            ):
                dp[i] = dp[i] or dp[i - 3]
        return dp[-1]