You are given an $n imes n$ symmetric binary adjacency matrix matrix representing an undirected graph with $n$ vertices labeled from $0$ to $n - 1$.

The entry matrix[i][j] is $1$ if an undirected edge connects vertex i and vertex j, and $0$ otherwise.

Return an array containing the degree of each vertex, where the degree of vertex i is the total number of edges connected to it.

Constraints:

• $1 \leq n ==$ matrix.length $==$ matrix[i].length $\leq 100$

• matrix[i][i] $= 0$

• matrix[i][j] is either $0$ or $1$

• matrix[i][j] $==$ matrix[j][i]

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.