Dynamic Programming

class InterestingParty:
	def best_invitaion(self, first, second):

# Case# 0
first = ['fishing', 'gradening', 'swimming', 'fishing']
second = ['hunting', 'fishing', 'fishing', 'biting']
result = 4

# Case# 1
first = ['Variety', 'diversity', 'loquacity', 'courtesy']
second = ['talking', 'speaking', 'discussion', 'meeting']
result = 1

# Case# 2
first = ['snakes', 'programming', 'cobra', 'monty']
second = ['python', 'python', 'anaconda', 'python']
result = 3

# Case# 3
first = ['t', 'o', 'p', 'c', 'o', 'd', 'e', 'r', 's', 'i', 'n', 'g', 'l', 'e',
 'r', 'o', 'u', 'n', 'd', 'm', 'a', 't', 'c', 'h', 'f', 'o', 'u', 'r', 'n', 'i']
second = ['n', 'e', 'f', 'o', 'u', 'r', 'j', 'a', 'n', 'u', 'a', 'r', 'y', 't',
 'w', 'e', 'n', 't', 'y', 't', 'w', 'o', 's', 'a', 't', 'u', 'r', 'd', 'a', 'y']
result = 6

class InterestingParty:
    def best_invitation(self, first, second):
        ans = 0

        for i in range(len(first)):
            f = 0
            s = 0

            for j in range(len(first)):
                if first[i] == first[j]:
                    f += 1
                if first[i] == second[j]:
                    f += 1
                if second[i] == first[j]:
                    s += 1
                if second[i] == second[j]:
                    s += 1

            ans = max(f, ans)
            ans = max(s, ans)

        return ans

class InterestingParty:
    def best_invitation(self, first, second):
        dic = {}

        for i in range(len(first)):
            dic[first[i]] = 0
            dic[second[i]] = 0

        for i in range(len(first)):
            dic[first[i]] += 1
            dic[second[i]] += 1

        ans = 0
        for key in dic:
            ans = max(ans, dic[key])

        return ans