Leetcode 1615. Maximal Network Rank

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1615. Maximal Network Rank

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact