m must be equal for k consecutive blocks. We can check for each possible starting index if this is true.

Approach

Iterate over all possible starting indices i from 0 to len(arr) - m * k + 1.
For each i, check if the subarray arr[i:i+m] repeats k times consecutively.
If such a pattern is found, return true.
If no such pattern is found, return false.

Code

[{"language":"C++","code":"class Solution {\npublic:\n    bool containsPattern(vector<int>& arr, int m, int k) {\n        int n = arr.size();\n        for (int i = 0; i <= n - m * k; ++i) {\n            bool ok = true;\n            for (int j = 0; j < m * k; ++j) {\n                if (arr[i + j] != arr[i + j % m]) {\n                    ok = false;\n                    break;\n                }\n            }\n            if (ok) return true;\n        }\n        return false;\n    }\n};","lang":"cpp","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">class</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> Solution</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">public:</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">    bool</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> containsPattern</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\">vector</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">&#x3C;</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">></span><span style=\"color:#D73A49;--shiki-dark:#F97583\">&#x26;</span><span style=\"color:#E36209;--shiki-dark:#FFAB70\"> arr</span><span style=\"color

Related Tags