Add problem 2760: Longest Even Odd Subarray With Threshold

Author: EFanZh

src/lib.rs

@@ -1958,6 +1958,7 @@ pub mod problem_2734_lexicographically_smallest_string_after_substring_operation
 pub mod problem_2739_total_distance_traveled;
 pub mod problem_2740_find_the_value_of_the_partition;
 pub mod problem_2744_find_maximum_number_of_string_pairs;
+pub mod problem_2760_longest_even_odd_subarray_with_threshold;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2760_longest_even_odd_subarray_with_threshold/mod.rs

@@ -0,0 +1,23 @@
+pub mod sliding_window;
+
+pub trait Solution {
+    fn longest_alternating_subarray(nums: Vec<i32>, threshold: i32) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            ((&[3, 2, 5, 4] as &[_], 5), 3),
+            ((&[1, 2], 2), 1),
+            ((&[2, 3, 4, 5], 4), 3),
+            ((&[8, 10, 7, 8, 3], 9), 2),
+        ];
+
+        for ((nums, threshold), expected) in test_cases {
+            assert_eq!(S::longest_alternating_subarray(nums.to_vec(), threshold), expected);
+        }
+    }
+}

src/problem_2760_longest_even_odd_subarray_with_threshold/sliding_window.rs

@@ -0,0 +1,48 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn longest_alternating_subarray(nums: Vec<i32>, threshold: i32) -> i32 {
+        let mut result = 0;
+        let mut length = 0;
+        let mut prev_is_even = false;
+
+        for num in nums {
+            if num <= threshold {
+                let is_even = num % 2 == 0;
+
+                if is_even == prev_is_even {
+                    result = result.max(length);
+                    length = i32::from(is_even);
+                } else {
+                    length += 1;
+                }
+
+                prev_is_even = is_even;
+            } else {
+                result = result.max(length);
+                length = 0;
+                prev_is_even = false;
+            }
+        }
+
+        result.max(length)
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn longest_alternating_subarray(nums: Vec<i32>, threshold: i32) -> i32 {
+        Self::longest_alternating_subarray(nums, threshold)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}