# Minimum Average Difference: Study Guide

Minimum Average Difference shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For each split index i, compare floor(avg of prefix 0..i) with floor(avg of suffix i+1..n-1) (suffix avg is 0 if empty). Return the smallest i that minimizes the absolute difference.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Using ceil instead of floor, or treating an empty suffix as undefined rather than 0.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI coding interview assistant.