Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.