Add solution #1452

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,308 LeetCode solutions in JavaScript
+# 1,309 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1109,6 +1109,7 @@
 1449|[Form Largest Integer With Digits That Add up to Target](./solutions/1449-form-largest-integer-with-digits-that-add-up-to-target.js)|Hard|
 1450|[Number of Students Doing Homework at a Given Time](./solutions/1450-number-of-students-doing-homework-at-a-given-time.js)|Easy|
 1451|[Rearrange Words in a Sentence](./solutions/1451-rearrange-words-in-a-sentence.js)|Medium|
+1452|[People Whose List of Favorite Companies Is Not a Subset of Another List](./solutions/1452-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list.js)|Medium|
 1455|[Check If a Word Occurs As a Prefix of Any Word in a Sentence](./solutions/1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.js)|Easy|
 1456|[Maximum Number of Vowels in a Substring of Given Length](./solutions/1456-maximum-number-of-vowels-in-a-substring-of-given-length.js)|Medium|
 1460|[Make Two Arrays Equal by Reversing Sub-arrays](./solutions/1460-make-two-arrays-equal-by-reversing-sub-arrays.js)|Easy|

solutions/1452-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list.js

@@ -0,0 +1,43 @@
+/**
+ * 1452. People Whose List of Favorite Companies Is Not a Subset of Another List
+ * https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/
+ * Difficulty: Medium
+ *
+ * Given the array favoriteCompanies where favoriteCompanies[i] is the list of favorites companies
+ * for the ith person (indexed from 0).
+ *
+ * Return the indices of people whose list of favorite companies is not a subset of any other list
+ * of favorites companies. You must return the indices in increasing order.
+ */
+
+/**
+ * @param {string[][]} favoriteCompanies
+ * @return {number[]}
+ */
+var peopleIndexes = function(favoriteCompanies) {
+  const companySets = favoriteCompanies.map(companies => new Set(companies));
+  const result = [];
+
+  for (let i = 0; i < favoriteCompanies.length; i++) {
+    let isSubset = false;
+    for (let j = 0; j < favoriteCompanies.length; j++) {
+      if (i !== j && isSubsetOf(companySets[i], companySets[j])) {
+        isSubset = true;
+        break;
+      }
+    }
+    if (!isSubset) {
+      result.push(i);
+    }
+  }
+
+  return result;
+
+  function isSubsetOf(setA, setB) {
+    if (setA.size > setB.size) return false;
+    for (const item of setA) {
+      if (!setB.has(item)) return false;
+    }
+    return true;
+  }
+};