You are given an integer array nums of size n and an integer array pattern of size m containing only the values $1$, $0$, and $-1$.

A contiguous subarray of nums of size $m + 1$ starting at index i is said to match pattern if for every integer k where $0 \leq k < m$, the following conditions hold:

• nums[i + k + 1] > nums[i + k] if pattern[k] == 1

• nums[i + k + 1] == nums[i + k] if pattern[k] == 0

• nums[i + k + 1] < nums[i + k] if pattern[k] == -1

Return the total number of subarrays in nums that match pattern.

Constraints:

• $2 \leq n ==$ nums.length $\leq 10^6$

• $1 \leq$ nums[i] $\leq 10^9$

• $1 \leq m ==$ pattern.length $< n$

• $-1 \leq$ pattern[i] $\leq 1$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.