Leetcode 3034. Number of Subarrays That Match a Pattern I

Count how many contiguous subarrays of length m+1 in nums have adjacent pairs that match a given pattern of -1/0/1 (interpreted as <, ==, > respectively). In other words, for each window check that sign(nums[i+k+1] − nums[i+k]) equals pattern[k] for all k.