# Longest Subarray Of Ones After Deleting One Element: Walkthrough
Longest Subarray Of Ones After Deleting One Element shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
You must delete exactly one element; maximize the remaining contiguous 1s. Sliding window that allows at most one 0 inside; the answer is window length - 1 (the deleted element). If the array is all 1s you still have to delete one.
## 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
Forgetting the mandatory deletion so an all-1s array returns n, or allowing more than one zero.
## 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 try it free.