Time Needed to Inform All Employees - Depth First Search (#158)

* Time needed to inform all employees

Time needed to inform all employees - Depth First Search.

* Update README.md

Author: POORVI111

C++/Time-Needed-To-Inform-All-Employees.cpp

@@ -0,0 +1,29 @@
+//CPP DFS SOLUTION
+
+// Problem statement: Return the no of mins required to inform all employees about the urgent news
+
+class Solution {
+public:
+    vector<int> adjList[100005];
+    
+    int dfs(int headID, vector<int>& informTime)
+    {
+        int maxTime=0;
+        for(auto employee : adjList[headID])
+        {
+            maxTime=max(maxTime, dfs(employee, informTime));
+        }
+        return informTime[headID] + maxTime;
+    }
+    int numOfMinutes(int n, int headID, vector<int>& manager, vector<int>& informTime) {
+        for(int i=0;i<n;i++)
+        {
+            if(manager[i]!=-1)
+                adjList[manager[i]].push_back(i);
+        }
+        return dfs(headID, informTime);
+    }
+};
+
+//Space Complexity: O(N)
+//Time Complexity : O(N)

README.md

@@ -335,8 +335,8 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | 104  | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [python](./Python/maximum-depth-of-binary-tree.py) | _O(n)_      | _O(n)_      | Easy       | DFS |      |
 | 112 | [Path Sum](https://leetcode.com/problems/path-sum/) | [Java](./Java/path-sum.java) | _O(n)_ | _O(n)_ | Easy | DFS |     |
 | 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [Java](./Java/Balanced-Binary-Tree.java) | _O(n)_ | _O(n)_ | Easy | DFS |     |
-
-<br/>
+| 1376 | [ Time Needed to Inform All Employees] (https://leetcode.com/problems/time-needed-to-inform-all-employees/) | [C++] | _O(n)_ | _O(n)_ | Medium | DFS |     | 
+|<br/>
 <div align="right">
     <b><a href="#algorithms">⬆️ Back to Top</a></b>
 </div>