From 2b8b3ed98054049e8bb306ab3c0207b0d0745a23 Mon Sep 17 00:00:00 2001
From: shreyathevampire <shreyavanga97@gmail.com>
Date: Sat, 3 Oct 2020 13:00:18 +0530
Subject: [PATCH] Added solution to problem 1376

---
 ...76.time-needed-to-inform-all-employees.cpp | 26 +++++++++++++++++++
 1 file changed, 26 insertions(+)
 create mode 100644 LeetCode/1376.time-needed-to-inform-all-employees.cpp

diff --git a/LeetCode/1376.time-needed-to-inform-all-employees.cpp b/LeetCode/1376.time-needed-to-inform-all-employees.cpp
new file mode 100644
index 0000000..6c1311a
--- /dev/null
+++ b/LeetCode/1376.time-needed-to-inform-all-employees.cpp
@@ -0,0 +1,26 @@
+class Solution {
+public:
+    vector<int>visited;
+    long long int dfs(vector<vector<int>>& adj, vector<int>& informTime, int src, int n)
+    {
+        long long int count = 0;
+        for(int i=0;i<adj[src].size();i++)
+        {
+            count = max(count,dfs(adj, informTime, adj[src][i], n));
+        }
+        return (informTime[src]+count);
+    }
+    int numOfMinutes(int n, int headID, vector<int>& manager, vector<int>& informTime) {
+        vector<vector<int>>adj(n);
+        for(int i=0;i<manager.size();i++)
+        {
+            if(manager[i] != -1)
+                adj[manager[i]].push_back(i);
+        }
+        long long int time;
+        visited.resize(n,0);
+        visited[headID] = 1;
+        time= dfs(adj, informTime, headID, n);
+        return time;
+    }
+};