update

neetcode/0001-two-sum.rs

@@ -0,0 +1,15 @@
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
+        let mut check = HashMap::new();
+        for (idx, val) in nums.iter().enumerate() {
+            if let Some(&idx2) = check.get(&(target - val)) {
+                return vec![idx as i32, idx2 as i32];
+            } else {
+                check.insert(val, idx as i32);
+            }
+        }
+        unreachable!()
+    }
+}

neetcode/0217-contains-duplicate.rs

@@ -0,0 +1,15 @@
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn contains_duplicate(nums: Vec<i32>) -> bool {
+        let mut check = HashSet::new();
+        for val in nums.iter() {
+            if check.contains(val) {
+                return true;
+            } else {
+                check.insert(val);
+            }
+        }
+        return false;
+    }
+}