Available question text
Given an undirected graph of n cities and roads, compute the maximum over all unordered city pairs of the total number of roads incident to either city, counting a shared road only once. This is equivalent to taking the sum of their degrees and subtracting one if the two cities are directly connected.
Related questions
Continue with questions that share topics or the same question type.
- Coding round in hacker rank.
Coding
- Compute the Rank as a Percentage
Coding
- Coordinate With Maximum Network Quality
Coding
- Count Pairs of Connectable Servers in a Weighted Tree Network
Coding · Array · Depth-First Search · Tree
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1615. Maximal Network Rank
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source