Set 12 - Graphs BFS/DFS
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 417. Pacific Atlantic Water Flow | Medium | Multi-source DFS | Video |
| LC 207. Course Schedule | Medium | Topological Sort | Video |
| LC 210. Course Schedule II | Medium | Topological Sort | 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 417: multi-source DFS from borders; intersect reachability.
- LC 207: topo sort / DFS cycle detection.
- LC 210: Kahn’s algorithm or DFS postorder for order.
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...