Set 23 - Advanced Graph Algorithms
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 323. Number of Connected Components | Medium | Union Find | Video |
| LC 261. Graph Valid Tree | Medium | Union Find | Video |
| LC 127. Word Ladder | Hard | BFS | 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 323: union find or DFS; count components.
- LC 261: valid tree = n-1 edges + connected.
- LC 127: BFS on word graph; use pattern buckets.
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...