Add solution #1462

Author: JoshCrozier

README.md

@@ -392,6 +392,7 @@
 1455|[Check If a Word Occurs As a Prefix of Any Word in a Sentence](./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](./1456-maximum-number-of-vowels-in-a-substring-of-given-length.js)|Medium|
 1460|[Make Two Arrays Equal by Reversing Sub-arrays](./1460-make-two-arrays-equal-by-reversing-sub-arrays.js)|Easy|
+1462|[Course Schedule IV](./1462-course-schedule-iv.js)|Medium|
 1464|[Maximum Product of Two Elements in an Array](./1464-maximum-product-of-two-elements-in-an-array.js)|Easy|
 1466|[Reorder Routes to Make All Paths Lead to the City Zero](./1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.js)|Medium|
 1470|[Shuffle the Array](./1470-shuffle-the-array.js)|Easy|

solutions/1462-course-schedule-iv.js

@@ -0,0 +1,43 @@
+/**
+ * 1462. Course Schedule IV
+ * https://leetcode.com/problems/course-schedule-iv/
+ * Difficulty: Medium
+ *
+ * There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1.
+ * You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you
+ * must take course ai first if you want to take course bi.
+ *
+ * - For example, the pair [0, 1] indicates that you have to take course 0 before you can take
+ *   course 1.
+ *
+ * Prerequisites can also be indirect. If course a is a prerequisite of course b, and course b
+ * is a prerequisite of course c, then course a is a prerequisite of course c.
+ *
+ * You are also given an array queries where queries[j] = [uj, vj]. For the jth query, you
+ * should answer whether course uj is a prerequisite of course vj or not.
+ *
+ * Return a boolean array answer, where answer[j] is the answer to the jth query.
+ */
+
+/**
+ * @param {number} numCourses
+ * @param {number[][]} prerequisites
+ * @param {number[][]} queries
+ * @return {boolean[]}
+ */
+var checkIfPrerequisite = function(numCourses, prerequisites, queries) {
+  const lookup = new Array(numCourses).fill().map(() => new Array(numCourses).fill(false));
+  prerequisites.forEach(([u, v]) => lookup[u][v] = true);
+
+  for (let i = 0; i < numCourses; i++) {
+    for (let j = 0; j < numCourses; j++) {
+      for (let k = 0; k < numCourses; k++) {
+        if (lookup[j][i] && lookup[i][k]) {
+          lookup[j][k] = true;
+        }
+      }
+    }
+  }
+
+  return queries.map(([u, v]) => lookup[u][v]);
+};