1
/*
2
 * author: deytulsi18
3
 * problem:
4
 * https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/
5
 * time complexity: O(n*n*m)
6
 * auxiliary space: O(1)
7
 * language: cpp
8
 */
9
class Solution {
10
 public:
11
  bool isSubset(vector<string> &b, vector<string> &a) {
12
    return (includes(a.begin(), a.end(), b.begin(), b.end()));
13
  }
14
  vector<int> peopleIndexes(vector<vector<string>> &favoriteCompanies) {
15
    int n = favoriteCompanies.size();
16
    vector<int> res;
17

18
    for (auto &i : favoriteCompanies) sort(begin(i), end(i));
19

20
    for (int i = 0; i < n; i++) {
21
      bool isValid = true;
22

23
      for (int j = 0; j < n; j++)
24
        if (i != j)
25
          if (isSubset(favoriteCompanies[i], favoriteCompanies[j])) {
26
            isValid = false;
27
            break;
28
          }
29

30
      if (isValid) res.emplace_back(i);
31
    }
32

33
    return res;
34
  }
35
};
36
;