"""
737. Sentence Similarity II

Given two sentences words1, words2 (each represented as an array of strings), and a list of similar word pairs pairs,
determine if two sentences are similar.

For example, words1 = ["great", "acting", "skills"] and words2 = ["fine", "drama", "talent"] are similar,
if the similar word pairs are pairs = [["great", "good"], ["fine", "good"], ["acting","drama"], ["skills","talent"]].

Note that the similarity relation is transitive. For example, if "great" and "good" are similar, and "fine" and "good" are similar,
then "great" and "fine" are similar.

Similarity is also symmetric. For example, "great" and "fine" being similar is the same as "fine" and "great" being similar.

Also, a word is always similar with itself. For example, the sentences words1 = ["great"], words2 = ["great"], pairs = []
are similar, even though there are no specified similar word pairs.

Finally, sentences can only be similar if they have the same number of words. So a sentence like
words1 = ["great"] can never be similar to words2 = ["doubleplus","good"].

Note:

The length of words1 and words2 will not exceed 1000.
The length of pairs will not exceed 2000.
The length of each pairs[i] will be 2.
The length of each words[i] and pairs[i][j] will be in the range [1, 20].

Companies 
Google

"""
# Mown solution with bugs
# Solution: maintain a defaultdict of lists and write a helper method to search for the word pairs using recursion
# Bug1: Need to check  words1[i] != words2[i]
# Bug2: when creating self.visited, self.visited = set([words1[i]])
#
from collections import defaultdict
class Solution(object):
    def areSentencesSimilarTwo(self, words1, words2, pairs):
        """
        :type words1: List[str]
        :type words2: List[str]
        :type pairs: List[List[str]]
        :rtype: bool
        """
        if len(words1) != len(words2):
            return False

        self.mapr = defaultdict(list)
        for pair in pairs:
            self.mapr[pair[0]].append(pair[1])
            self.mapr[pair[1]].append(pair[0])

        for i in range(len(words1)):
            self.visited = set([words1[i]])
            if words1[i] != words2[i] and not self.is_similar(words1[i], words2[i]):
                return False
        return   True

    def is_similar(self, str1, str2):
        for tstr in self.mapr[str1]:
            if tstr in self.visited:
                continue

            elif tstr == str2:
                return True

            else:
                self.visited.add(tstr)
                if self.is_similar(tstr, str2):
                    return True

        return False
