Hi guys, i have this problem. In a given array a length n, how many consecutive subsequence are there that satisfies: max_element — min_element of the subsequence is even. 1 <= n <= 1e5. I can't figure out a better solution than O(n^2) solution. How to solve this problem? Thanks!