Grokking the Coding Interview: Patterns for Coding Questions
Vote

0% completed

​

Solution: Tasks Scheduling

.....

.....

.....

Like the course? Get enrolled and start learning!
A

Anonymous

· 3 years ago

Hello,

if Task Scheduling is similar to Topological Sort, the time complexity should be O(V+E) but it is written as O(V+E)O(V+E) in the solution. I checked step d and the code (Java) was identical.

Thanks

A

Anonymous

· 5 years ago

Hey the JS solution has this:

console.log(`Is scheduling possible: ${
is_scheduling_possible(6, [
[0, 4],
[1, 4],
[3, 2],
[1, 3],
])}`);

It's missing the first 2 tuples in 2nd arg: [2, 5], [0, 5],

Show 1 reply

Reading Progress

0%

Vote for new content