Add problem 2374: Node With Highest Edge Score

src/lib.rs

@@ -1766,6 +1766,7 @@ pub mod problem_2368_reachable_nodes_with_restrictions;
 pub mod problem_2369_check_if_there_is_a_valid_partition_for_the_array;
 pub mod problem_2370_longest_ideal_subsequence;
 pub mod problem_2373_largest_local_values_in_a_matrix;
+pub mod problem_2374_node_with_highest_edge_score;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2374_node_with_highest_edge_score/iterative.rs

@@ -0,0 +1,39 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn edge_score(edges: Vec<i32>) -> i32 {
+        let mut sums = vec![0_u32; edges.len()].into_boxed_slice();
+
+        (0..).zip(edges).for_each(|(from, to)| sums[to as u32 as usize] += from);
+
+        let mut result = 0;
+        let mut max_sum = 0;
+
+        (0..).zip(&*sums).for_each(|(i, &sum)| {
+            if sum > max_sum {
+                max_sum = sum;
+                result = i;
+            }
+        });
+
+        result
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn edge_score(edges: Vec<i32>) -> i32 {
+        Self::edge_score(edges)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2374_node_with_highest_edge_score/mod.rs

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