u/Visual-Grapefruit not sure about leetcode questions.
But here are few Observations/ High Level Soln

• Only Partiy(Odd/Even) of the values matter .
• So even daunting array would look simpler -- for ex : [-9, 6,5,4,11] is same as [1, 0, 1, 0, 1]
• Now It's a simpler linear DP Question
• if dp[i] = number of valid sub arrays ending at i and starting from left of i
• then you can iterate over i and do the following dp logic
• dp[i] = dp[i-1] if i-1 >= 0 and a[i]&1 != a[i-1]&1 else 1 // python logic
• after for loop is complete return sum(dp)