Lonely Pixel I, is a LeetCode problem. In this post we will see how we can solve this challenge in C++

Problem Description

Given a picture consisting of black and white pixels, find the number of black lonely pixels.

The picture is represented by a 2D char array consisting of 'B' and 'W', which means black and white pixels respectively.

A black lonely pixel is character 'B' that located at a specific position where the same row and same column don't have any other black pixels.

Example:

Input: [['W', 'W', 'B'], ....

You can find the full details of the problem Lonely Pixel I at LeetCode

Solution: Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @kamyu104