LeetCode 34 Find First and Last Position of Element - Why Naive Fails

Find the target with one binary search, then expand left and right to find boundaries.

The expansion step is $O(k)$ where $k$ is the number of occurrences. If the entire array contains the target, that's $O(n)$.

The problem requires $O(\log n)$. You need a way to find each boundary directly.