Skip to content

Tracks

AI-assisted engineering Working with AI Agents System design Core systems Data and AI systems Coding Coding problems Code review On-call SQL

Practice

Paths Concept guides

FreeAd-supported

The plan adds AI feedback and removes ads.

Concept guides/Graphs and trees/Advanced graph algorithms

CodingGraphs and trees

Advanced graph algorithms

Hard3 min read

Questions it teaches

Eulerian path existenceMedium25 min Maximum spanning tree weightMedium25 min Shortest path count moduloMedium30 min Lexicographically smallest topological sortMedium25 min Bipartite graph coloringMedium25 min Eulerian path existsMedium25 min Split people into teamsMedium25 min Maximum edge-disjoint pathsMedium30 min

Related

Graphs and trees Searching and sorting Designing data structures Dynamic programming

Builds on: Searching and sorting

Sorting algorithms3 min Two pointers3 min

Builds on: Designing data structures

Queues, deques & ring buffers3 min Database deduplication3 min

Leads to: Dynamic programming

Dynamic programming: 2D & strings3 min Dynamic programming: 1D3 min

© 2026 Prep Room·From California·AI can make mistakes.

About Legal Contact Cookies Your privacy choices

Home Review Tracks Paths