Uncategorized

A holding area for graph problems that don't yet belong to a named pattern section. As patterns emerge, these get promoted into their own sections.

1791. Find Center of Star Graph

Easy·

1791Find Center of Star Graph

3 Approaches

Degree Counting

O(V + E) timeO(V) aux

First Repeat Wins

O(1) timeO(1) aux

Read Two Edges

O(1) timeO(1) aux

class Solution:

def findCenter(self, edges: List[List[int]]) -> int:

counter = collections.defaultdict(int)

for a, b in edges:

counter[a] += 1

counter[b] += 1

for node, degree in counter.items():

if degree == len(counter) - 1:

return node

---