Coach note
Coding questions test whether you can carry a problem from a vague spec to a working solution while talking through your decisions. Interviewers watch the process at least as much as the answer.
Coding · Algorithms
Given a directed graph represented as an adjacency list, detect if there's a cycle. Optimize for graphs with millions of nodes and explain your space-time trade-offs.
Type your answer
0of ~140 wordsAbout a minute spoken
Voice isn’t supported in this browser — type your answer in the box.
Create a free account to get more critiques.
Your answer appears here as you speak.