# Find The Middle Index In Array: Study Guide
Find The Middle Index In Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Return the leftmost index where the left sum equals the right sum (empty sides are 0), or -1. One pass for the total, then a running left sum; right = total - left - nums[i].
## 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
Starting from the rightmost pivot, or excluding the pivot from the wrong side twice.
## 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 official website.