solves minimum index of 2 lists

Author: anishLearnsToCode

README.md

@@ -157,7 +157,7 @@
 | 590 | [N-Ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | Easy | [![Java](assets/java.png)](src/NAryTreePostorderTraversal.java) [![Python](assets/python.png)](python/n_ary_tree_postorder_traversal.py) |
 | 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | Easy | [![Java](assets/java.png)](src/LongestHarmoniousSubsequence.java) [![Python](assets/python.png)](python/longest_harmonious_subequence.py) |
 | 598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | Easy | [![Java](assets/java.png)](src/RangeAdditionII.java) [![Python](assets/python.png)](python/range_addition_ii.py) |
-| 599 | [Minimum Index Sum of 2 Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | Easy | |
+| 599 | [Minimum Index Sum of 2 Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | Easy | [![Java](assets/java.png)](src/MinimumIndexSumOfTwoLists.java) [![Python](assets/python.png)](python/minimum_index_sum_of_two_lists.py) |
 | 604 | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) | Easy | |
 | 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | Easy | |
 | 606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | Easy | |

python/minimum_index_sum_of_two_lists.py

@@ -0,0 +1,17 @@
+from typing import List
+
+
+class Solution:
+    def findRestaurant(self, list1: List[str], list2: List[str]) -> List[str]:
+        restaurant1_2_indices = {}
+        index_sum = float('inf')
+        result = []
+        for index, restaurant in enumerate(list1):
+            restaurant1_2_indices[restaurant] = index
+        for index, restaurant in enumerate(list2):
+            if index + restaurant1_2_indices.get(restaurant, float('inf')) < index_sum:
+                index_sum = index + restaurant1_2_indices[restaurant]
+                result = [restaurant]
+            elif index + restaurant1_2_indices.get(restaurant, float('inf')) == index_sum:
+                result.append(restaurant)
+        return result

src/MinimumIndexSumOfTwoLists.java

@@ -0,0 +1,40 @@
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+public class MinimumIndexSumOfTwoLists {
+    public String[] findRestaurant(String[] list1, String[] list2) {
+        int indexSum = Integer.MAX_VALUE;
+        List<String> result = new ArrayList<>();
+        Map<String, Integer> restaurantIndices = getValueToIndexMap(list1);
+        for (int index = 0 ; index < list2.length ; index++) {
+            if (restaurantIndices.containsKey(list2[index])) {
+                if (index + restaurantIndices.get(list2[index]) < indexSum) {
+                    result.clear();
+                    result.add(list2[index]);
+                    indexSum = index + restaurantIndices.get(list2[index]);
+                } else if(index + restaurantIndices.get(list2[index]) == indexSum) {
+                    result.add(list2[index]);
+                }
+            }
+        }
+        return toArray(result);
+    }
+
+    private String[] toArray(List<String> strings) {
+        String[] result = new String[strings.size()];
+        for (int index = 0 ; index < result.length ; index++) {
+            result[index] = strings.get(index);
+        }
+        return result;
+    }
+
+    private Map<String, Integer> getValueToIndexMap(String[] array) {
+        Map<String, Integer> result = new HashMap<>();
+        for (int index = 0 ; index < array.length ; index++) {
+            result.put(array[index], index);
+        }
+        return result;
+    }
+}