# Count Servers That Communicate: Study Guide

Count Servers That Communicate shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A server communicates if another server shares its row or column. Count servers per row and column, then count cells that are 1 whose row-count>=2 or column-count>=2.

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

Doing DFS/union-find on the grid, or requiring a server to have both a row-mate and a column-mate.

## 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 official website.