-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCourse-Schedule-II.cpp
More file actions
38 lines (31 loc) · 1.15 KB
/
Copy pathCourse-Schedule-II.cpp
File metadata and controls
38 lines (31 loc) · 1.15 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
// Company tags: Anduril, Arista Networks, ByteDance, Citadel, Databricks, DoorDash, eBay, Intuit, Karat, Netflix, Oracle, PhonePe, Robinhood, Salesforce, Snap, Snowflake, Tesla, VMware, Walmart Labs, Zenefit
class Solution {
public:
// T.C: O(V + E)
// S.C: O(V + E)
vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
unordered_map<int, vector<int>> adj;
vector<int> indegree(numCourses, 0);
vector<int> result;
for(auto& prerequisite : prerequisites){
int u = prerequisite[0];
int v = prerequisite[1];
adj[v].push_back(u);
indegree[u]++;
}
queue<int> q;
for(int i = 0; i < numCourses; i++){
if(indegree[i] == 0) q.push(i);
}
while(!q.empty()){
int u = q.front();
q.pop();
result.push_back(u);
for(auto& v : adj[u]){
indegree[v]--;
if(indegree[v] == 0) q.push(v);
}
}
return result.size() != numCourses ? vector<int>() : result;
}
};