Gahiz_

Topological Sort

Challenges: 3Medium: 2Hard: 1

This Topological Sort set gathers 3 coding problems, with a mix of 2 medium, 1 hard. They show up in interviews at companies like Amazon, Careem, Google, Meta, Siemens EDA, so you can master the pattern once and recognize it everywhere.

Topological Sort coding problems

  • Cache Invalidation Planner

    Difficulty: HardAsked by: Amazon, Careem, Google

  • Cyclic Dependency Detector

    Difficulty: MediumAsked by: Amazon, Meta

  • Detect Cycle in Directed Graph

    Difficulty: MediumAsked by: Siemens EDA

Asked by

Ready to practice for real?

Work through Topological Sort problems in the editor, run your code, and check your solution against real test cases.

Practice coding challenges, start free