Added solution of problem 1566

Author: kurpenok

src/solutions/mod.rs

@@ -332,6 +332,7 @@ pub mod s1544_make_the_string_great;
 pub mod s1550_three_consecutive_odds;
 pub mod s1556_thousand_separator;
 pub mod s1560_most_visited_sector_in_a_circular_track;
+pub mod s1566_detect_pattern_of_length_m_repeated_k_or_more_times;
 pub mod s1619_mean_of_array_after_removing_some_elements;
 pub mod s1935_maximum_number_of_words_you_can_type;
 pub mod s1957_delete_characters_to_make_fancy_string;

src/solutions/s1566_detect_pattern_of_length_m_repeated_k_or_more_times.rs

@@ -0,0 +1,47 @@
+pub fn contains_pattern(arr: Vec<i32>, m: i32, k: i32) -> bool {
+    let mut result: bool = false;
+    let mut count: i32 = 0;
+
+    if arr.len() < (m * k) as usize {
+        return result;
+    }
+
+    'main: for i in 0..=(arr.len() - (m * k) as usize) {
+        let mut prev = None;
+        for subset in arr[i..].chunks_exact(m as usize) {
+            let current = Some(subset);
+            match prev == current {
+                true => count += 1,
+                false => count = 0,
+            }
+
+            if count + 1 == k {
+                result = true;
+                break 'main;
+            }
+            prev = current;
+        }
+    }
+
+    result
+}
+
+#[cfg(test)]
+mod test {
+    use super::*;
+
+    #[test]
+    fn test_case_1() {
+        assert_eq!(contains_pattern(vec![1, 2, 4, 4, 4, 4], 1, 3), true);
+    }
+
+    #[test]
+    fn test_case_2() {
+        assert_eq!(contains_pattern(vec![1, 2, 1, 2, 1, 1, 1, 3], 2, 2), true);
+    }
+
+    #[test]
+    fn test_case_3() {
+        assert_eq!(contains_pattern(vec![1, 2, 1, 2, 1, 3], 2, 3), false);
+    }
+}