Day 61 of 133
CI/CD for ML (CD4ML) + DSA 1-D DP
Code + data + model + deployment pipelines; tests for ML.
DSA · NeetCode 1-D DP
- House RobberDSA · 1-D DP
Interview questions to prep
- State the DP: rob(i) = max(rob(i-1), rob(i-2) + nums[i]).
- Generalize to house-robber-ii (circular street) — what's the trick?
- House Robber IIDSA · 1-D DP
Interview questions to prep
- State the DP: define the state, the transition, and the base case explicitly.
- Top-down (memoized recursion) vs bottom-up (tabulation) — which is more natural here, and why?
- Can you space-optimize from O(n) to O(1)? Show the rolling-window trick.
MLOps · CI/CD for ML
Interview questions to prep
- How does CI/CD for ML differ from traditional CI/CD?
- What are the four levels of MLOps maturity (Google's framing)?
Interview questions to prep
- What kinds of tests do you write specifically for ML code?
- What is a behavioral test (CheckList) for an NLP model?
Interview questions to prep
- Compare shadow, canary, and blue/green deployments for ML.
- What's the operational cost of running a shadow deployment for weeks before you cut over?
References & further reading
- Eugene Yan — applied ML writing ↗Eugene Yan
- Made with ML — full MLOps course ↗Goku Mohandas
- Full Stack Deep Learning ↗FSDL