Day 60 of 133

Training pipelines & experiment tracking

Airflow vs Kubeflow vs Prefect; MLflow / W&B; reproducibility traps.

DSA · NeetCode 1-D DP

  • Climbing StairsDSA · 1-D DP

    Interview questions to prep

    1. Recognize this as Fibonacci. Walk through DP → space-optimized to O(1).
    2. Generalize to 'k steps at a time' — how does the recurrence change?
  • Interview questions to prep

    1. State the DP: define the state, the transition, and the base case explicitly.
    2. Top-down (memoized recursion) vs bottom-up (tabulation) — which is more natural here, and why?
    3. Can you space-optimize from O(n) to O(1)? Show the rolling-window trick.

MLOps · Training pipelines & experiment tracking

References & further reading