# Lonely Pixel II: Study Guide

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

## Key idea

Count black pixels 'B' that lie in a row containing exactly N blacks, whose row string is repeated in exactly N rows, and whose column also contains exactly N blacks. Group rows by their signature string and combine with column counts.

## 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

Ignoring the 'row pattern appears N times' rule and only using the row/col counts (that is Lonely Pixel I generalized, not II).

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