Maximal Network Rank LeetCode solution in Python

1
class Solution:
2
    def maximalNetworkRank(self, n: int, roads) -> int:
3
        max_rank = 0
4
        connections = {i: set() for i in range(n)}
5
        for i, j in roads:
6
            connections[i].add(j)
7
            connections[j].add(i)
8
        for i in range(n - 1):
9
            for j in range(i + 1, n):
10
                max_rank = max(
11
                    max_rank,
12
                    len(connections[i]) + len(connections[j]) - (j in connections[i]),
13
                )
14
        return max_rank