InterviewDB Question

Perplexity SWE Phone - Dependency Validation (Graph/Topological Sort)

Question Details

Problem Validate a dependency graph for cycles or ordering conflicts, using topological sort. Likely LeetCode equivalent Similar to LC 207 Course Schedule. Tags coding, graph, topological_sort, phone

Full Details

🔒

Unlock all Perplexity questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — $100 a year, unlimited access

About This Question

This is a reported interview question from a perplexity interview during the phone round.

It covers the following topics: Coding, Phone, Graph .