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

Determine whether the array can be partitioned into contiguous subarrays each of which is either two equal elements, three equal elements, or three consecutive increasing elements. This is typically solved with a linear DP (or greedy) over prefixes to check if a valid partitioning exists for n up to 1e5.