Given an array of positive integers arr, determine if there is a contiguous subarray of length m that repeats $k$ or more consecutive times.

A pattern is a sequence of consecutive elements. A repetition of this pattern consists of the exact same sequence appearing at least $k$ times back to back without interruption.

Return true if any such pattern exists, and false otherwise.

Constraints:

• $2 \leq$ arr.length $\leq 100$

• $1 \leq$ arr[i] $\leq 100$

• $1 \leq$ m $\leq 100$

• $2 \leq$ k $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.