Add solution #690

Author: JoshCrozier

README.md

@@ -521,6 +521,7 @@
 687|[Longest Univalue Path](./0687-longest-univalue-path.js)|Medium|
 688|[Knight Probability in Chessboard](./0688-knight-probability-in-chessboard.js)|Medium|
 689|[Maximum Sum of 3 Non-Overlapping Subarrays](./0689-maximum-sum-of-3-non-overlapping-subarrays.js)|Hard|
+690|[Employee Importance](./0690-employee-importance.js)|Medium|
 693|[Binary Number with Alternating Bits](./0693-binary-number-with-alternating-bits.js)|Easy|
 695|[Max Area of Island](./0695-max-area-of-island.js)|Medium|
 696|[Count Binary Substrings](./0696-count-binary-substrings.js)|Easy|

solutions/0690-employee-importance.js

@@ -0,0 +1,41 @@
+/**
+ * 690. Employee Importance
+ * https://leetcode.com/problems/employee-importance/
+ * Difficulty: Medium
+ *
+ * You have a data structure of employee information, including the employee's unique ID,
+ * importance value, and direct subordinates' IDs.
+ *
+ * You are given an array of employees employees where:
+ * - employees[i].id is the ID of the ith employee.
+ * - employees[i].importance is the importance value of the ith employee.
+ * - employees[i].subordinates is a list of the IDs of the direct subordinates of the ith employee.
+ *
+ * Given an integer id that represents an employee's ID, return the total importance value of this
+ * employee and all their direct and indirect subordinates.
+ */
+
+/**
+ * Definition for Employee.
+ * function Employee(id, importance, subordinates) {
+ *     this.id = id;
+ *     this.importance = importance;
+ *     this.subordinates = subordinates;
+ * }
+ */
+
+/**
+ * @param {Employee[]} employees
+ * @param {number} id
+ * @return {number}
+ */
+var GetImportance = function(employees, id) {
+  const map = new Map(employees.map(e => [e.id, e]));
+  return dfs(id);
+
+  function dfs(id) {
+    if (!map.has(id)) return 0;
+    const e = map.get(id);
+    return e.importance + e.subordinates.reduce((sum, id) => sum + dfs(id), 0);
+  }
+};