Learn and practice the Cyclic Sort and Topological Sort patterns to solve coding interview problems.

Educative-99 in Java: Accelerate Your Coding Interview Prep

This module will focus on two advanced sorting algorithms, Cyclic Sort and Topological Sort. These are often used in coding interviews as a way to distinguish between average and outstanding candidates. Cyclic Sort may only be used if the input list meets certain criteria, and in those situations, it’s the most efficient sorting algorithm possible. Topological Sort utilizes graph-based algorithms to deal with partially ordered elements. This module teaches us to recognize whether either of these advanced sorting techniques is applicable, as well as how to use them to solve the given problem.

Advanced Sorting Techniques

# Statement
There are a total of $n$ classes labeled with the English alphabet ($A$, $B$, $C$, and so on). Some classes are dependent on other classes for compilation. For example, if class $B$ extends class $A$, then $B$ has a dependency on $A$. Therefore, $A$ must be compiled before $B$.

Given a list of the dependency pairs, find the order in which the classes should be compiled.

**Constraints:**
- Class name should be an uppercase character.
- $0 \leq$ `dependencies.length` $\leq 676$
- `dependencies[i].length` $= 2$
- All dependency pairs should be unique.

# Examples



Try to solve the Compilation Order problem.

Cyclic Sort

Topological Sort

Conclusion

Compilation Order

Statement