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

A subarray of nums of size $m + 1$ starting at index i matches pattern if for every index 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 number of subarrays of nums that match pattern.

Constraints:

• $2 \leq n ==$ nums.length $\leq 100$

• $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.