# Find First And Last Position Of Element In Sorted Array: Practice Notes

Find First And Last Position Of Element In Sorted Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Two binary searches: one for the leftmost index >= target and one for the leftmost index > target, then adjust.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(log n).

## Common mistake

Finding any match then scanning outward, which becomes O(n) on a huge run of duplicates.

## 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 multilingual AI interview assistant.