Leetcode 531. Lonely Pixel I

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 531. Lonely Pixel I

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact