Available question text
Given an m×n grid of 'B' and 'W', count how many black pixels are "lonely" — i.e., they are the only 'B' in both their row and their column; this is solved by aggregating row and column black counts and checking each black cell.
Related questions
Continue with questions that share topics or the same question type.
- Lonely Pixel II
Coding
- Find All Lonely Numbers in the Array
Coding · Array · Counting · Hash Table
- Find All The Lonely Nodes
Coding
- 0/1 Knapsack Problem with Time Complexity Optimization
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 531. Lonely Pixel I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source