# Minimum Cost To Make All Characters Equal: Interview Notes

Minimum Cost To Make All Characters Equal shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A move flips a prefix or a suffix and costs the length of that segment. Walk the string and, whenever s[i] != s[i-1], add min(i, n-i) — the cheaper of flipping the left prefix or the right suffix.

## 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

Only considering prefixes, or flipping single characters at cost 1.

## 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 Linkjob AI interview assistant.