# Minimum Number Of Operations To Make All Array Elements Equal To One: Explained
Minimum Number Of Operations To Make All Array Elements Equal To One shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
If a gcd-1 subarray of length L exists, you can propagate a 1 in L-1 + (n-1) operations; if any 1 is already present the answer is n - count(1).
## 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^2 log A).
## Common mistake
Stopping at the first gcd without searching the shortest window.
## 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.