# Kadane Max Subarray (Practice 5014): Sketch
Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.
## Approach
running best ending here.
```python
def max_sub(a):
best=cur=a[0]
for x in a[1:]:
cur=max(x,cur+x); best=max(best,cur)
return best
```
## Complexity
Linear in the dominant input size for the scan; heap/tree variants add a log factor.
## Interview pitfalls
State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode.
## Practicing out loud
Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see [try it free](https://www.linkjob.ai/).