Done problem

961/main.rs

@@ -0,0 +1,18 @@
+use std::collections::HashMap;
+
+pub fn repeated_n_times(a: Vec<i32>) -> i32 {
+    let mut hm = HashMap::new();
+    for i in a {
+        if hm.contains_key(&i) {
+            return i;
+        } else {
+            hm.insert(i, 0);
+        }
+    }
+    return 0; // This is unecessary given the problem constraints, but rust needs it to be happy
+}
+
+pub fn main() {
+    println!("Expected: 3");
+    println!("Got: {}", repeated_n_times(vec![1 ,2, 3, 3]))
+}

961/problem.txt

@@ -0,0 +1,29 @@
+In a array A of size 2N, there are N+1 unique elements, and exactly one of these elements is repeated N times.
+
+Return the element repeated N times.
+
+
+Example 1:
+
+Input: [1,2,3,3]
+Output: 3
+
+Example 2:
+
+Input: [2,1,2,5,3,2]
+Output: 2
+
+Example 3:
+
+Input: [5,1,5,2,5,3,5,4]
+Output: 5
+
+ 
+
+Note:
+
+    4 <= A.length <= 10000
+    0 <= A[i] < 10000
+    A.length is even
+
+

961/run.sh

@@ -0,0 +1,5 @@
+#!/bin/bash
+
+rustc main.rs
+./main
+rm main