Leetcode 1566. Detect Pattern of Length M Repeated K or More Times
Determine whether there exists a contiguous subarray (pattern) of length m that repeats at least k times consecutively (i.e., k non-overlapping adjacent repeats) within the given array.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.