Day 65 of 133
Online experimentation for ML + DSA 1-D DP finish
A/B for models vs UI; shadow / canary / interleaving / off-policy.
DSA · NeetCode 1-D DP
- Longest Increasing SubsequenceDSA · 1-D DP
Interview questions to prep
- Walk through DP O(n²). Then walk through patience-sorting O(n log n) with binary search.
- What's the DIFFERENCE between LIS length and the actual subsequence — how do you reconstruct?
- Partition Equal Subset SumDSA · 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 · Online experimentation
Interview questions to prep
- How is A/B testing a model different from A/B testing a UI feature?
- What guardrail metrics do you track on every model launch?
Interview questions to prep
- When does interleaving beat A/B for ranking systems?
- What's the smallest canary slice that's still statistically meaningful for a ranking model?
Interview questions to prep
- What is off-policy evaluation, and where does it show up in recommender systems?
- Compare IPS vs doubly-robust off-policy estimators — when does each fall apart?
References & further reading
- Eugene Yan — applied ML writing ↗Eugene Yan
- Evan Miller — A/B testing pitfalls ↗Evan Miller