leetcode-algorithms/python/minimum_index_sum_of_two_lists.py at master · anishLearnsToCode/leetcode-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
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