Add problem 2399: Check Distances Between Same Letters

src/lib.rs

@@ -1785,6 +1785,7 @@ pub mod problem_2392_build_a_matrix_with_conditions;
 pub mod problem_2395_find_subarrays_with_equal_sum;
 pub mod problem_2396_strictly_palindromic_number;
 pub mod problem_2397_maximum_rows_covered_by_columns;
+pub mod problem_2399_check_distances_between_same_letters;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2399_check_distances_between_same_letters/iterative.rs

@@ -0,0 +1,41 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn check_distances(s: String, distance: Vec<i32>) -> bool {
+        let mut indices = [0_u8; 26];
+        let mut i = 0;
+
+        s.bytes().all(|c| {
+            let c = usize::from(c) - usize::from(b'a');
+            let state = &mut indices[c];
+
+            i += 1;
+
+            if *state == 0 {
+                *state = i;
+            } else if i - *state - 1 != distance[c] as u8 {
+                return false;
+            }
+
+            true
+        })
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn check_distances(s: String, distance: Vec<i32>) -> bool {
+        Self::check_distances(s, distance)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2399_check_distances_between_same_letters/mod.rs

@@ -0,0 +1,37 @@
+pub mod iterative;
+
+pub trait Solution {
+    fn check_distances(s: String, distance: Vec<i32>) -> bool;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            (
+                (
+                    "abaccb",
+                    [
+                        1, 3, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+                    ],
+                ),
+                true,
+            ),
+            (
+                (
+                    "aa",
+                    [
+                        1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+                    ],
+                ),
+                false,
+            ),
+        ];
+
+        for ((s, distance), expected) in test_cases {
+            assert_eq!(S::check_distances(s.to_string(), distance.to_vec()), expected);
+        }
+    }
+}