Leetcode 3686. Number of Stable Subsequences

Count the number of subsequences of nums that do not contain three consecutive elements of the same parity, returning the result modulo 1e9+7. With n up to 1e5, this is typically solved by dynamic programming/state-tracking that remembers the last one or two parities to avoid forming parity triples.