LC 1497. Check If Array Pairs Are Divisible by k (Rust)

Author: raul-sauco

README.md

@@ -552,6 +552,7 @@ to the solution in this repository.
 | [1482. Minimum Number of Days to Make m Bouquets][lc1482]                                     | 🟠 Medium  | [![rust](res/rs.png)][lc1482rs]                                                                       |
 | [1491. Average Salary Excluding the Minimum and Maximum Salary][lc1491]                       | 🟢 Easy    | [![rust](res/rs.png)][lc1491rs]                                                                       |
 | [1493. Longest Subarray of 1's After Deleting One Element][lc1493]                            | 🟠 Medium  | [![rust](res/rs.png)][lc1493rs]                                                                       |
+| [1497. Check If Array Pairs Are Divisible by k][lc1497]                                       | 🟠 Medium  | [![rust](res/rs.png)][lc1497rs]                                                                       |
 | [1498. Number of Subsequences That Satisfy the Given Sum Condition][lc1498]                   | 🟠 Medium  | [![python](res/py.png)][lc1498py]                                                                     |
 | [1502. Can Make Arithmetic Progression From Sequence][lc1502]                                 | 🟢 Easy    | [![rust](res/rs.png)][lc1502rs]                                                                       |
 | [1503. Last Moment Before All Ants Fall Out of a Plank][lc1503]                               | 🟠 Medium  | [![rust](res/rs.png)][lc1503rs]                                                                       |
@@ -1987,6 +1988,8 @@ to the solution in this repository.
 [lc1491rs]: leetcode/average-salary-excluding-the-minimum-and-maximum-salary.rs
 [lc1493]: https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/
 [lc1493rs]: leetcode/longest-subarray-of-1s-after-deleting-one-element.rs
+[lc1497]: https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/
+[lc1497rs]: leetcode/check-if-array-pairs-are-divisible-by-k.rs
 [lc1498]: https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/
 [lc1498py]: leetcode/number-of-subsequences-that-satisfy-the-given-sum-condition.py
 [lc1502]: https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/

leetcode/check-if-array-pairs-are-divisible-by-k.rs

@@ -0,0 +1,69 @@
+// 1497. Check If Array Pairs Are Divisible by k
+// 🟠 Medium
+//
+// https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/
+//
+// Tags: Array - Hash Table - Counting
+
+struct Solution;
+impl Solution {
+    /// Solution overview
+    ///
+    /// Time complexity: O() -
+    /// Space complexity: O() -
+    ///
+    /// Runtime  ms Beats %
+    /// Memory  MB Beats %
+    pub fn can_arrange(arr: Vec<i32>, k: i32) -> bool {
+        let mut mods = vec![0; k as usize];
+        for &num in &arr {
+            mods[(((num % k) + k) % k) as usize] += 1;
+        }
+        if mods[0] % 2 != 0 {
+            return false;
+        }
+        let k = k as usize;
+        for i in 1..k / 2 + 1 {
+            if mods[i] != mods[k - i] {
+                return false;
+            }
+        }
+        true
+    }
+}
+
+// Tests.
+fn main() {
+    let tests = [
+        (vec![-1, -1, -1, -1, 2, 2, -2, -2], 3, false),
+        (vec![-1, 1, -2, 2, -3, 3, -4, 4], 3, true),
+        (vec![1, 2, 3, 4, 5, 10, 6, 7, 8, 9], 5, true),
+        (vec![1, 2, 3, 4, 5, 6], 7, true),
+        (vec![1, 2, 3, 4, 5, 6], 10, false),
+    ];
+    println!("\n\x1b[92m» Running {} tests...\x1b[0m", tests.len());
+    let mut success = 0;
+    for (i, t) in tests.iter().enumerate() {
+        let res = Solution::can_arrange(t.0.clone(), t.1);
+        if res == t.2 {
+            success += 1;
+            println!("\x1b[92m✔\x1b[95m Test {} passed!\x1b[0m", i);
+        } else {
+            println!(
+                "\x1b[31mx\x1b[95m Test {} failed expected: {:?} but got {}!!\x1b[0m",
+                i, t.2, res
+            );
+        }
+    }
+    println!();
+    if success == tests.len() {
+        println!("\x1b[30;42m✔ All tests passed!\x1b[0m")
+    } else if success == 0 {
+        println!("\x1b[31mx \x1b[41;37mAll tests failed!\x1b[0m")
+    } else {
+        println!(
+            "\x1b[31mx\x1b[95m {} tests failed!\x1b[0m",
+            tests.len() - success
+        )
+    }
+}