# Lonely Pixel I: Interview Notes

Lonely Pixel I shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A lonely black pixel is a 'B' that is the only black in its row and column. Count blacks per row and column, then recount cells where picture[i][j]=='B' and row[i]==1 and col[j]==1.

## 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(mn).

## Common mistake

Returning the number of rows that contain a single B without checking the column, or mutating the matrix while counting.

## 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 linkjob.ai.