**Polyglot Contest - Amazon Top Interview Questions**

### Problem Statement :

You are given a two-dimensional list of strings languages, where languages[i] is a list of programming languages person i is fluent in. Consider any list of programming languages such that everyone knows at least one language in it. Return the minimum size of such list. Constraints 1 ≤ n, m ≤ 16 where n and m are the number of rows and columns in languages. 1 ≤ l ≤ 32 where l is the total number of distinct strings in languages. Example 1 Input languages = [ ["Java", "Perl"], ["C++", "Python"], ["Haskell"] ] Output 3 Explanation There is no overlap between the languages. Therefore any combination that uses one language from each participant is valid. Example 2 Input languages = [ ["Java", "C++", "Python"], ["Python", "Cobol", "Java"], ["C++", "Haskell"], ["Ruby", "C++"] ] Output 2 Explanation Valid combinations are ["Cobol", "C++"], ["Java", "C++"] and ["Python", "C++"]. Example 3 Input languages = [ ["C", "Python", "Haskell", "Kotlin"], ["Java", "JavaScript", "C++", "Rust"], ["JavaScript", "Python", "C++"], ["Ruby", "C++"], ["Rust", "Python", "Java"] ] Output 2 Explanation The only minimal combination is ["Python", "C++"].

### Solution :

` ````
Solution in C++ :
int solve(vector<vector<string>>& languages) {
int persons_count = languages.size();
vector<int> dp(1 << persons_count, INT32_MAX);
unordered_map<string, int> language_masks;
for (int i = 0; i < languages.size(); ++i) {
for (const auto& language : languages[i]) {
language_masks[language] |= (1 << i);
}
}
dp[0] = 0;
for (int mask = 1; mask < (1 << persons_count); ++mask) {
int bit = __builtin_ctz(mask);
for (auto& l : languages[bit]) {
int new_mask = mask ^ (language_masks[l] & mask);
dp[mask] = min(dp[mask], 1 + dp[new_mask]);
}
}
return dp[(1 << persons_count) - 1];
}
```

` ````
Solution in Python :
class Solution:
def solve(self, languages):
language_set = functools.reduce(set.union, map(set, languages))
language_index = {language: index for index, language in enumerate(language_set)}
language_masks = [
sum((1 << language_index[language]) for language in participant_languages)
for participant_languages in languages
]
n = len(languages)
l = len(language_set)
@functools.lru_cache(None)
def dp(language_index, participant_mask):
if not participant_mask:
return 0
if language_index == l:
return math.inf
new_participant_mask = participant_mask
for participant_index in range(n):
if new_participant_mask & (1 << participant_index) and language_masks[
participant_index
] & (1 << language_index):
new_participant_mask ^= 1 << participant_index
return min(
1 + dp(language_index + 1, new_participant_mask),
dp(language_index + 1, participant_mask),
)
return dp(0, (1 << n) - 1)
```

## View More Similar Problems

## Kitty's Calculations on a Tree

Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a

View Solution →## Is This a Binary Search Tree?

For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a

View Solution →## Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the

View Solution →## Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

View Solution →## Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .

View Solution →## Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

View Solution →