class Solution {
public:
    vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) {
        vector<string> ans;
        unordered_map<string,int> m2;
        for(int i=0;i<list2.size();i++)
            m2[list2[i]] = i;

        int minSum = INT_MAX;
        for(int i=0;i<list1.size();i++)
        {
            if(m2.count(list1[i]) > 0)
            {
                int j = m2[list1[i]];
                if(i + j < minSum)
                {
                    ans.clear();
                    ans.push_back(list1[i]);
                    minSum = i + j;
                }
                else if(i + j == minSum)
                {
                    ans.push_back(list1[i]);
                }
            }
        }
        return ans;
    }
};