The process consisted of 2 technical rounds, each lasting 45 minutes.

Round 1 (45 mins)

Minimum Completion Time of Dependent Tasks with Parallel Execution

Given:

• N tasks.
• Each task i has an execution time time[i].
• Dependencies are given as directed edges (u, v) meaning task v can start only after task u has completed.
• Multiple independent tasks may execute simultaneously.

Return:

1. The minimum total time required to complete all tasks.
2. A valid execution order (topological order).
3. -1 if the dependency graph contains a cycle.

Round 2 (45 mins)

Minimum Tools Required for File Format Conversion

Each tool supports a set of file formats and can convert between any pair of formats supported by that tool.

Example:

ToolA : [pdf, docx, txt]
ToolB : [txt, jpg]
ToolC : [jpg, png]

source = pdf
target = png

Output:

3
[ToolA, ToolB, ToolC]

Find the minimum number of tools required to convert the source format into the target format and return one valid sequence of tools used.

Verdict: Rejected