Day 58 of 133
Feature stores (Feast, Tecton) + point-in-time correctness + DSA Adv Graphs
Training/serving skew, offline/online stores, PIT joins.
DSA · NeetCode Advanced Graphs
- Network Delay TimeDSA · 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).
- Swim IN Rising WaterDSA · 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 · Feature stores
Interview questions to prep
- What is training/serving skew and how does a feature store eliminate it?
- When is a feature store overkill?
Interview questions to prep
- Walk through how Feast separates the offline and online stores.
- Compare Feast vs Tecton vs Vertex Feature Store — when does each fit?
Interview questions to prep
- Why is point-in-time correctness critical for training data, and how does feature store handle it?
- Walk me through how a leak from forward-looking features actually breaks model rollout.
References & further reading
- Feast feature store docs ↗Feast
- Eugene Yan — applied ML writing ↗Eugene Yan
- Made with ML — full MLOps course ↗Goku Mohandas