Added problems: 599 - Minimum Index Sum of Two Lists

Author: thegovyadina

README.md

@@ -45,6 +45,7 @@ Note that this license applies only to my solution code and not to the LeetCode
 | 🟢 263. [Ugly Number](https://leetcode.com/problems/ugly-number/)                                                                                                  |                         [🦀](src/problems/p0263_ugly_number.rs)                         |                                    |
 | 🟢 504. [Base 7](https://leetcode.com/problems/base-7/)                                                                                                            |                           [🦀](src/problems/p0504_base_7.rs)                            |                                    |
 | 🔴 552. [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii/)                                                                |                [🦀](src/problems/p0552_student_attendance_record_ii.rs)                 | Dynamic Programming                |
+| 🟢 599. [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/)                                                            |               [🦀](src/problems/p0599_minimum_index_sum_of_two_lists.rs)                | HashMap                            |
 | 🟢 645. [Set Mismatch](https://leetcode.com/problems/set-mismatch/)                                                                                                |                        [🦀](src/problems/p0645_set_mismatch.rs)                         |                                    |
 | 🟠 707. [Design Linked List](https://leetcode.com/problems/design-linked-list/)                                                                                    |                     [🦀](src/problems/p0707_design_linked_list.rs)                      |                                    |
 | 🟠 739. [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/)                                                                                    |                     [🦀](src/problems/p0739_daily_temperatures.rs)                      | Monotonic stack                    |

src/problems/mod.rs

@@ -11,6 +11,7 @@ pub mod p0227_basic_calculator_2;
 pub mod p0263_ugly_number;
 pub mod p0504_base_7;
 pub mod p0552_student_attendance_record_ii;
+pub mod p0599_minimum_index_sum_of_two_lists;
 pub mod p0645_set_mismatch;
 pub mod p0707_design_linked_list;
 pub mod p0739_daily_temperatures;

src/problems/p0599_minimum_index_sum_of_two_lists.rs

@@ -0,0 +1,79 @@
+//! # LeetCode Problem: 599 - Minimum Index Sum of Two Lists
+//!
+//! Difficulty: Easy
+//!
+//! Link: https://leetcode.com/problems/minimum-index-sum-of-two-lists/
+//!
+//! ## Complexity Analysis
+//! - Time Complexity: O(n + m) - We traverse the lists containing n and m elements exactly twice.
+//! - Space Complexity: O(min(n, m)) - The extra space required depends on the number of items
+//!         stored in the hash map, which is the size of the smaller list.
+pub struct Solution;
+
+impl Solution {
+    pub fn find_restaurant(list1: Vec<String>, list2: Vec<String>) -> Vec<String> {
+        let mut indices = std::collections::HashMap::new();
+        let mut min_sum = list1.len() + list2.len();
+        let mut result: Vec<String> = vec![];
+
+        for (i, element) in list1.iter().enumerate() {
+            indices.insert(element, i);
+        }
+
+        for (i, element) in list2.iter().enumerate() {
+            if let Some(&j) = indices.get(element) {
+                let sum = i + j;
+                if sum < min_sum {
+                    min_sum = sum;
+                    result.clear();
+                    result.push(element.clone());
+                } else if sum == min_sum {
+                    result.push(element.clone());
+                }
+            }
+        }
+        result
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    #[test]
+    fn test_find_restaurant() {
+        let test_cases = [
+            (
+                vec!["happy", "sad", "good"],
+                vec!["sad", "happy", "good"],
+                vec!["sad", "happy"],
+            ),
+            (
+                vec!["Shogun", "Tapioca Express", "Burger King", "KFC"],
+                vec!["KFC", "Shogun", "Burger King"],
+                vec!["Shogun"],
+            ),
+            (
+                vec!["Shogun", "Tapioca Express", "Burger King", "KFC"],
+                vec![
+                    "Piatti",
+                    "The Grill at Torrey Pines",
+                    "Hungry Hunter Steakhouse",
+                    "Shogun",
+                ],
+                vec!["Shogun"],
+            ),
+        ];
+        for (idx, (list1, list2, expected)) in test_cases.iter().enumerate() {
+            let list1_strings: Vec<String> = list1.iter().map(|&s| s.to_string()).collect();
+            let list2_strings: Vec<String> = list2.iter().map(|&s| s.to_string()).collect();
+            let expected_strings: Vec<String> = expected.iter().map(|&s| s.to_string()).collect();
+            let result = Solution::find_restaurant(list1_strings, list2_strings);
+            assert_eq!(
+                result, expected_strings,
+                "Test case #{}: with list1 = {:?}, list2 = {:?}, expected {:?}, got {:?}",
+                idx, list1, list2, expected, result
+            );
+        }
+    }
+}