Given an array favoriteCompanies where favoriteCompanies[i] is the list of favorite companies for the $i$-th person (indexed from $0$), return the indices of people whose list of favorite companies is not a subset of any other person’s list of favorite companies.

The returned indices must be sorted in increasing order.

Constraints:

• $1 \leq$ favoriteCompanies.length $\leq 100$

• $1 \leq$ favoriteCompanies[i].length $\leq 500$

• $1 \leq$ favoriteCompanies[i][j].length $\leq 20$

• All strings in favoriteCompanies[i] are distinct.

• All lists of favorite companies are distinct, meaning if each list is sorted alphabetically, favoriteCompanies[i] != favoriteCompanies[j] for all $i \neq j$.

• All strings consist of lowercase English letters only.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.