Set 22 - Advanced Graph Algorithms
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 743. Network Delay Time | Medium | Dijkstra | Video |
| LC 787. Cheapest Flights Within K Stops | Medium | Bellman-Ford | Video |
| LC 684. Redundant Connection | Medium | Union Find | Video |
Deliverables
- Write a 1-line invariant for each problem.
- Note 1 edge case or pitfall per problem.
- Record time-to-first-correct solution.
Notes
- LC 743: Dijkstra with min-heap; max distance.
- LC 787: Bellman-Ford K+1 relaxations or BFS by stops.
- LC 684: union find; first edge that forms cycle.
Review
- Time spent + where you got stuck?
- Biggest mistake or missed edge case?
- One concrete improvement for next time.
Comments
Share your approach or ask questions
?
|
Markdown supported
Sign in to post
Loading comments...