solve(0929): implement solution using hash map

Author: kallydev

src/solutions/_0929_unique_email_addresses.rs

@@ -0,0 +1,53 @@
+use std::collections::HashSet;
+
+use crate::solutions::Solution;
+
+impl Solution {
+    pub fn num_unique_emails(emails: Vec<String>) -> i32 {
+        let mut hash_set = HashSet::new();
+
+        for email in emails {
+            let (local, domain) = email.split_once("@").unwrap();
+
+            let local = {
+                let local = match local.split_once("+") {
+                    Some((local, _)) => local.to_owned(),
+                    None => local.to_owned(),
+                };
+
+                local.replace(".", "")
+            };
+
+            hash_set.insert(local.to_owned() + "@" + domain);
+        }
+
+        hash_set.len() as i32
+    }
+}
+
+#[test]
+fn test() {
+    assert_eq!(
+        Solution::num_unique_emails(vec![
+            "[email protected]".to_owned(),
+            "[email protected]".to_owned(),
+            "[email protected]".to_owned(),
+        ]),
+        2
+    );
+    assert_eq!(
+        Solution::num_unique_emails(vec![
+            "[email protected]".to_owned(),
+            "[email protected]".to_owned(),
+            "[email protected]".to_owned()
+        ]),
+        3
+    );
+    assert_eq!(
+        Solution::num_unique_emails(vec![
+            "[email protected]".to_owned(),
+            "[email protected]".to_owned(),
+        ]),
+        2
+    );
+}

src/solutions/mod.rs

@@ -3,6 +3,7 @@ pub mod _0009_palindrome_number;
 pub mod _0020_valid_parentheses;
 pub mod _0026_remove_duplicates_from_sorted_array;
 pub mod _0027_remove_element;
+pub mod _0929_unique_email_addresses;
 pub mod _1848_minimum_distance_to_the_target_element;
 pub mod _2351_first_letter_to_appear_twice;
 pub mod _3046_split_the_array;