# Binary Search First True (Practice 4336): Pattern
Interviewers love binary search first true because it checks whether you can state the invariant before coding. Here is a compact rehearsal note.
## Approach
Keep lo/hi; mid True shrinks hi else lo = mid+1.
```python
def first_true(n, pred):
lo, hi = 0, n
while lo < hi:
mid = (lo + hi) // 2
if pred(mid): hi = mid
else: lo = mid + 1
return lo
```
## 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 [AI help for online coding assessments](https://www.linkjob.ai/coding-interview-copilot/).