-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCourse-Schedule.cpp
More file actions
36 lines (31 loc) · 1.09 KB
/
Copy pathCourse-Schedule.cpp
File metadata and controls
36 lines (31 loc) · 1.09 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
// Company tags: Anduril, Agoda, ByteDance, Citade, Coupang, Docusign, eBay, Flipkart, Karat, Nvidia, Nutanix, Oracle, Snap, Snowflake, Visa, VMware, Walmart Labs, Yelp, Zenefits.
class Solution {
public:
// Time Complexity : O(N + P) N = Number of courses, P = Number of prerequisites
// Space Complexity : O(N + P)
bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
unordered_map<int, vector<int>> adj;
vector<int> indegree(numCourses, 0);
for(auto& prerequisite : prerequisites){
int u = prerequisite[0];
int v = prerequisite[1];
adj[u].push_back(v);
indegree[v]++;
}
queue<int> q;
for(int i = 0; i < numCourses; i++){
if(indegree[i] == 0) q.push(i);
}
int count = 0;
while(!q.empty()){
int u = q.front();
q.pop();
count++;
for(auto& v : adj[u]){
indegree[v]--;
if(indegree[v] == 0) q.push(v);
}
}
return count == numCourses;
}
};