You receive N lines of raw text describing task dependencies,
e.g.,
'A after B',
'C->A',
'B before D'.
Implement a function that:
- parses the strings into a graph;
- handles duplicate/unknown tasks and invalid inputs gracefully;
- returns one valid topological order of tasks;
- detects cycles.
Analyze time and space complexity.
...
e.g.,
'A after B',
'C->A',
'B before D'.
Implement a function that:
- parses the strings into a graph;
- handles duplicate/unknown tasks and invalid inputs gracefully;
- returns one valid topological order of tasks;
- detects cycles.
Analyze time and space complexity.
...
Get one-to-one training from Google Facebook engineers
Top-notch Professionals
Learn from Facebook and Google senior engineers interviewed 100+ candidates.
Most recent interview questions and system design topics gathered from aonecode alumnus.
One-to-one online classes. Get feedbacks from real interviewers.
Customized Private Class
Already a coding expert? - Advance straight to hard interview topics of your interest.
New to the ground? - Develop basic coding skills with your own designated mentor.
Days before interview? - Focus on most important problems in target company question bank.