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

    1. State the DP: rob(i) = max(rob(i-1), rob(i-2) + nums[i]).
    2. Generalize to house-robber-ii (circular street) — what's the trick?
  • House Robber IIDSA · 1-D DP

    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 · CI/CD for ML

References & further reading