Create a second array <code>nums2</code> such that <code>nums2[i] = 1</code> if <code>nums[i + 1] > nums[i]</code>, <code>nums2[i] = 0</code> if <code>nums[i + 1] == nums[i]</code>, and <code>nums2[i] = -1</code> if <code>nums[i + 1] < nums[i]</code>.

The problem becomes: “Count the number of subarrays in <code>nums2</code> that are equal to <code>pattern</code>.

Use Knuth-Morris-Pratt or Z-Function algorithms.