#1566

Detect Pattern of Length M Repeated K or More Times

pupil · 490 · lc easy +27 · verified · 43.8% accepted · 689 likes · top 25%

Description

Given an array of positive integers arr, determine whether it contains a subarray of length m that repeats consecutively at least k times without any overlap. Return true if such a repeated pattern exists, otherwise return false.

Example 1:

Input: arr = [1,2,4,4,4,4], m = 1, k = 3

Output: true

Explanation: The pattern (4) of length 1 is repeated 4 consecutive times. Notice that pattern can be repeated k or more times but not less.

Example 2:

Input: arr = [1,2,1,2,1,1,1,3], m = 2, k = 2

Output: true

Explanation: The pattern (1,2) of length 2 is repeated 2 consecutive times. Another valid pattern (2,1) is also repeated 2 times.

Example 3:

Input: arr = [1,2,1,2,1,3], m = 2, k = 3

Output: false

Explanation: The pattern (1,2) is of length 2 but is repeated only 2 times. There is no pattern of length 2 that is repeated 3 or more times.

Code

1

2

3

class Solution:
    def containsPattern(self, arr: List[int], m: int, k: int) -> bool:

class Solution:
    def containsPattern(self, arr: List[int], m: int, k: int) -> bool: