Day 57 of 133
ML lifecycle, roles, team topology + DSA Adv Graphs
End-to-end map of failure modes; researcher vs MLE vs MLOps.
DSA · NeetCode Advanced Graphs
- Reconstruct ItineraryDSA · Advanced Graphs
Interview questions to prep
- Pick between Dijkstra, Bellman-Ford, Floyd-Warshall, MST (Prim/Kruskal), or topo sort — defend the choice.
- What does this problem assume about edge weights (non-negative? integer? bounded?) — and what breaks if those don't hold?
- Walk me through complexity in V and E, and the data-structure choice (heap vs Fibonacci heap vs array).
- Min Cost TO Connect All PointsDSA · Advanced Graphs
Interview questions to prep
- Pick between Dijkstra, Bellman-Ford, Floyd-Warshall, MST (Prim/Kruskal), or topo sort — defend the choice.
- What does this problem assume about edge weights (non-negative? integer? bounded?) — and what breaks if those don't hold?
- Walk me through complexity in V and E, and the data-structure choice (heap vs Fibonacci heap vs array).
MLOps · ML lifecycle
Interview questions to prep
- Walk through the end-to-end ML lifecycle and the failure modes at each stage.
- Where do most ML projects actually fail in the lifecycle, and what catches it earlier?
Interview questions to prep
- Compare the responsibilities of an ML researcher vs an MLE vs an MLOps engineer.
- When does a company actually need a dedicated ML platform team — and what's the smallest valid platform?
Interview questions to prep
- How would you structure an ML team at a 50-person startup vs a 5,000-person company?
- Where do ownership disputes typically erupt between data, ML, and platform teams — and how do you preempt them?
References & further reading
- Made with ML — full MLOps course ↗Goku Mohandas
- Chip Huyen — ML Systems Design ↗Chip Huyen
- Eugene Yan — applied ML writing ↗Eugene Yan
- Full Stack Deep Learning ↗FSDL