You are given a binary matrix grid with m rows and n columns. A cell value of $1$ represents a server, and a cell value of $0$ represents an empty cell.

Two servers can communicate if they are located in the same row or in the same column. A server is considered communicating if it can communicate with at least one other server.

Return the total number of servers in grid that can communicate with at least one other server.

Constraints:

• m == grid.length

• n == grid[i].length

• $1 \leq$ m $\leq 250$

• $1 \leq$ n $\leq 250$

• grid[i][j] == 0 or grid[i][j] == 1

Input: grid = [[1,0],[0,1]]-List[List[int]]
Output: 0-int
Explanation: Each server is alone in its row and column, so no server can communicate with another.

Input: grid = [[1,0],[1,1]]-List[List[int]]
Output: 3-int
Explanation: The servers at (0,0) and (1,0) communicate via the same column, and the servers at (1,0) and (1,1) communicate via the same row, so all 3 servers can communicate with at least one other server.

Input: grid = [[1,1,0],[0,0,1],[0,0,1]]-List[List[int]]
Output: 4-int
Explanation: Row 0 has two servers, (0,0) and (0,1), which communicate, and column 2 has two servers, (1,2) and (2,2), which communicate, for a total of 2 + 2 = 4 communicating servers.

Input: grid = [[1,0,0],[0,1,0],[0,0,1]]-List[List[int]]
Output: 0-int
Explanation: All servers are isolated (no shared row or column with another server).

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.