# Binary Search First True (Practice 5050): Pattern

Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.

## Approach

Search the first index where a monotonic predicate becomes true.

```python
def first_true(n,ok):
lo,hi=0,n
while lo mid=(lo+hi)//2
if ok(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 assistant for technical interviews.