Add problem 2958: Length of Longest Subarray With at Most K Frequency

Author: EFanZh

src/lib.rs

@@ -2028,6 +2028,7 @@ pub mod problem_2952_minimum_number_of_coins_to_be_added;
 pub mod problem_2956_find_common_elements_between_two_arrays;
 pub mod problem_2957_remove_adjacent_almost_equal_characters;
 pub mod problem_2958_length_of_longest_subarray_with_at_most_k_frequency;
+pub mod problem_2960_count_tested_devices_after_test_operations;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2960_count_tested_devices_after_test_operations/iterative.rs

@@ -0,0 +1,31 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn count_tested_devices(battery_percentages: Vec<i32>) -> i32 {
+        let mut result = 0;
+
+        for &battery in &battery_percentages {
+            result += i32::from(battery - result > 0);
+        }
+
+        result
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn count_tested_devices(battery_percentages: Vec<i32>) -> i32 {
+        Self::count_tested_devices(battery_percentages)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2960_count_tested_devices_after_test_operations/mod.rs

@@ -0,0 +1,18 @@
+pub mod iterative;
+
+pub trait Solution {
+    fn count_tested_devices(battery_percentages: Vec<i32>) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [(&[1, 1, 2, 1, 3] as &[_], 3), (&[0, 1, 2], 2)];
+
+        for (battery_percentages, expected) in test_cases {
+            assert_eq!(S::count_tested_devices(battery_percentages.to_vec()), expected);
+        }
+    }
+}