Minimum Index Sum of Two Lists LeetCode solution in Python

1
class Solution:
2
    def findRestaurant(self, list1: List[str], list2: List[str]) -> List[str]:
3

4
        hashmap1 = {}
5
        hashmap2 = {}
6
        common = {}
7
        for i in range(len(list1)):
8

9
            hashmap1[list1[i]] = i
10

11
        for j in range(len(list2)):
12
            hashmap2[list2[j]] = j
13

14
        for i in hashmap1:
15

16
            if i in hashmap2:
17
                print(1)
18
                common[i] = hashmap1[i] + hashmap2[i]
19

20
        common = list(common.items())
21

22
        answer = []
23
        minimum = float("inf")
24

25
        for i in range(0, len(common)):
26

27
            if common[i][1] < minimum:
28
                minimum = common[i][1]
29

30
        for i in range(len(common)):
31

32
            if common[i][1] == minimum:
33
                answer.append(common[i][0])
34

35
        return answer