Added intersection of two arrays solution.

README.md

@@ -112,6 +112,7 @@ other languages.
 - Sort by Number of Bits (https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits)
 - Make the String Great (https://leetcode.com/problems/make-the-string-great/)
 - Excel Column Number (https://leetcode.com/problems/excel-sheet-column-number/)
+- Intersection of Two Arrays (https://leetcode.com/problems/intersection-of-two-arrays-ii)
 
 #### Medium
 

src/leetcode/intersection_two.rs

@@ -0,0 +1,35 @@
+use std::collections::HashMap;
+
+pub fn intersect(numbers_one: Vec<i32>, numbers_two: Vec<i32>) -> Vec<i32> {
+    let mut counts = numbers_one
+        .into_iter()
+        .fold(HashMap::new(), |mut acc, curr| {
+            *acc.entry(curr).or_insert(0) += 1;
+            acc
+        });
+
+    let mut result = Vec::new();
+    for number in numbers_two {
+        if let Some(count) = counts.get_mut(&number) {
+            if *count > 0 {
+                result.push(number);
+                *count -= 1;
+            }
+        }
+    }
+    result
+}
+g
+#[cfg(test)]
+mod tests {
+    use std::vec;
+
+    use super::intersect;
+
+    #[test]
+    fn test_intersect() {
+        let result = intersect(vec![1, 2, 3, 3, 1, 5, 6], vec![1, 3, 3, 1]);
+        let expected = vec![1, 3, 3, 1];
+        assert_eq!(expected, result)
+    }
+}

src/leetcode/mod.rs

@@ -42,3 +42,4 @@ mod unique_occurrences;
 mod zero_or_one;
 mod sort_colors;
 mod rotate_digits;
+mod intersection_two;