def word_subsets_brute_force(words1, words2):
    result = []

    for word1 in words1:
        is_subset = True

        # Iterate through each word in the second list
        for word2 in words2:
            word1_counts = {}
            word2_counts = {}

            for char in word1:
                word1_counts[char] = word1_counts.get(char, 0) + 1
            for char in word2:
                word2_counts[char] = word2_counts.get(char, 0) + 1

            # Check if word1 contains all letters of word2 with sufficient counts
            for char, count in word2_counts.items():
                if char not in word1_counts or word1_counts[char] < count:
                    is_subset = False
                    break
        
        # Only add to result if word1 is a subset of all words2
        if is_subset:
            result.append(word1)

    return result

def word_subsets(words1, words2):
    master_letter_requirements = [0] * 26

    # Find maximum letter frequencies required across all words2
    for word2 in words2:
        word_letter_frequency = [0] * 26
        for letter in word2:
            word_letter_frequency[ord(letter) - ord('a')] += 1
        for i in range(26):
            master_letter_requirements[i] = max(master_letter_requirements[i], word_letter_frequency[i])

    result = []

    # Iterate through words1 to check for subset property
    for word1 in words1:
        word1_letter_frequency = [0] * 26

        # Count frequencies for each letter
        for letter in word1:
            word1_letter_frequency[ord(letter) - ord('a')] += 1

        is_subset = True
        # Check if all letters meet min. requirements
        for i in range(26):
            if word1_letter_frequency[i] < master_letter_requirements[i]:
                is_subset = False
                break

        # Add to result if the word meets frequency requirements.
        if is_subset:
            result.append(word1)

    return result