MediumCoding

Given a list of jobs and a list of dependencies where each job depends on another job being completed first, determine if it is possible to complete all jobs.

Asked at

Oracle

1Give yourself 5 minutes

2Answer out loud, not in your head

3Then compare with the answer below

Reference answer

This problem can be solved by modeling the jobs and their dependencies as a directed graph. Each job is a node, and a dependency from job A to job B is a directed edge from A to B. The task then becomes detecting if there is a cycle in this graph. If a cycle exists, it means there's a circular dependency, making it impossible to complete all jobs. If no cycle is found, then all jobs can be completed.

Free to read · better with Enzo

Practice this out loud with Enzo

Enzo runs it as a mock interview, pushes back with follow-ups, and grades you on the rubric.

Continue with Enzo Sign up free

Next question

Calculate the trapped rainwater between bars in a given array.
Find a triplet in an array with a given sum.
Print all combinations of numbers from 1 to n that sum to n.
Find the number of rotations in a circularly sorted array.
Find all permutations of a given string.
Check if two given binary trees are identical.