# Maximal Network Rank: Explained

Maximal Network Rank shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

n cities and undirected roads. The rank of a pair is the number of roads connected to either city (a shared road counted once). Count degrees, then try every pair: deg[i] + deg[j] - (1 if they are directly connected). A boolean adjacency set makes the connected check O(1).

## 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(n^2 + e).

## Common mistake

Forgetting to subtract the shared edge, or only considering adjacent pairs (non-adjacent pairs can still have high rank).

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