Add problem 3115: Maximum Prime Difference

Author: EFanZh

src/lib.rs

@@ -2094,6 +2094,7 @@ pub mod problem_3107_minimum_operations_to_make_median_of_array_equal_to_k;
 pub mod problem_3110_score_of_a_string;
 pub mod problem_3111_minimum_rectangles_to_cover_points;
 pub mod problem_3114_latest_time_you_can_obtain_after_replacing_characters;
+pub mod problem_3115_maximum_prime_difference;
 pub mod problem_3350_adjacent_increasing_subarrays_detection_ii;
 
 #[cfg(test)]

src/problem_3115_maximum_prime_difference/greedy.rs

@@ -0,0 +1,39 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn maximum_prime_difference(nums: Vec<i32>) -> i32 {
+        const PRIMES: [u64; 2] = [0x_2820_8A20_A08A_28AC, 0x_8002_28A2_0208_8288];
+
+        let mut iter = nums.iter().enumerate().filter_map(|(i, &num)| {
+            let num = num as u8;
+
+            PRIMES
+                .get(usize::from(num / 64))
+                .is_some_and(|&bits| bits & (1 << (num % 64)) != 0)
+                .then_some(i)
+        });
+
+        let first = iter.next().unwrap();
+        let last = iter.next_back().unwrap_or(first);
+
+        (last - first) as _
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn maximum_prime_difference(nums: Vec<i32>) -> i32 {
+        Self::maximum_prime_difference(nums)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3115_maximum_prime_difference/mod.rs

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