Detect Pattern of Length M Repeated K or More Times LeetCode solution in Python

1
class Solution:
2
    def containsPattern(self, arr: List[int], m: int, k: int) -> bool:
3
        if len(arr) < k * m:
4
            return False
5

6
        n = len(arr)
7
        pattern = arr[0:m]
8
        repeats = 1
9
        for i in range(m, n - m + 1, m):
10
            if arr[i : i + m] != pattern:
11
                break
12

13
            repeats += 1
14
            if repeats >= k:
15
                return True
16

17
        return self.containsPattern(arr[1:], m, k)