690_Employee_Importance

Author: partho-maple

README.md

@@ -615,6 +615,7 @@ BFS, DFS, Dijkstra, Floyd–Warshall, Bellman-Ford, Kruskal, Prim's, Minimum Spa
 |48| [1376. Time Needed to Inform All Employees](https://tinyurl.com/y3e5bb22) | [Python](https://tinyurl.com/wu6rdaw/1376_Time_Needed_to_Inform_All_Employees.py), [Swift](https://tinyurl.com/wuja3c4/1376_Time_Needed_to_Inform_All_Employees.swift) | [Art 1](https://tinyurl.com/y2lw6s4j) | Medium |📌 BFS, DFS |
 |49| [286. Walls and Gates](https://tinyurl.com/y3ollzsl) | [Python](https://tinyurl.com/wu6rdaw/286_Walls_and_Gates.py), [Swift](https://tinyurl.com/wuja3c4/286_Walls_and_Gates.swift) | --- | Medium |📌 BFS, DFS |
 |50| [286. Walls and Gates](https://tinyurl.com/y2xk6r98) | [Python](https://tinyurl.com/wu6rdaw/1138_Alphabet_Board_Path.py), [Swift](https://tinyurl.com/wuja3c4/1138_Alphabet_Board_Path.swift) | --- | Medium |📌 BFS |
+|51| [690. Employee Importance](https://tinyurl.com/yyweuk43) | [Python](https://tinyurl.com/wu6rdaw/690_Employee_Importance.py), [Swift](https://tinyurl.com/wuja3c4/690_Employee_Importance.swift) | --- | Easy |📌 BFS |
 
 
 </p>

leetcode.com/swift/DS_ALGO_PRAC.playground/Sources/swift/690_Employee_Importance.swift

@@ -0,0 +1,43 @@
+/**
+ * Definition for Employee.
+ * public class Employee {
+ *     public var id: Int
+ *     public var importance: Int
+ *     public var subordinates: [Int]
+ *     public init(_ id: Int, _ importance: Int, _ subordinates: [Int]) {
+ *         self.id = id
+ *         self.importance = importance
+ *         self.subordinates = subordinates
+ *     }
+ * }
+ */
+
+import Foundation
+class Solution {
+    func getImportance(_ employees: [Employee], _ id: Int) -> Int {
+        var importance = 0
+        var id_importance_map = [Int:Int]()
+        var id_subordinates_map = [Int:Set<Int>]()
+
+        for employee in employees {
+            id_importance_map[employee.id] = employee.importance
+            id_subordinates_map[employee.id] = Set<Int>(employee.subordinates)
+        }
+        
+        var queue = [Int]()
+        queue.append(id)
+        var visited = Set<Int>()
+        while !queue.isEmpty {
+            let current_id = queue.removeFirst()
+            importance += id_importance_map[current_id]!
+            for subordinate in id_subordinates_map[current_id]! {
+                if !visited.contains(subordinate) {
+                    visited.insert(subordinate)
+                    queue.append(subordinate)
+                }
+            }
+        }
+        
+        return importance
+    }
+}