Skip to main content
012Possible?
mediumBlind 75

Course Schedule

Course Schedule tests whether you can keep a best-so-far structure honest as you go. Interviewers love it because it reveals your priority-based reasoning and your edge-case discipline. Interviewers watch whether you keep your heap in sync as inputs evolve.

BFS / DFSGraphsHeap / Priority Queue

Learn this pattern

Graph Interview Questions

BFS explores by layers using a queue; DFS explores deeply using a stack or recursion -- the same traversal with a different container. Choose BFS for shortest-path in unweighted graphs and "minimum steps," DFS for counting components, islands, and tree recursion.

Coco
Fin

Meet your coaches

Talk through the problem while you code. Signed-in reps become prep memory for the next session.

Chat with Fin or Coco right now on mobile.

Start talking through the problem here. Switch to desktop when you're ready to code and run tests.

Start coaching session
1Can Finish All Coursesmedium
2Part 2
3Part 3

Start Part 1 to unlock your next challenge

Based onLeetCode

Desktop required

Sorry - mobile cannot run the editor and tests yet. Use the next step below or email yourself a link to continue on desktop.

Read the pattern guide

Graph Interview Questions gives you a useful next rep while you are still on your phone.