Given an integer array degrees of length $n$, determine whether there exists a simple undirected graph with $n$ vertices such that the degree of the vertices matches the elements in degrees.

Return true if such a graph exists, or false otherwise.

Note: A simple graph is an undirected graph with no self loops and no multiple edges between any pair of vertices.

Constraints:

• $1 \leq n ==$ degrees.length $\leq 10^5$

• $0 \leq$ degrees[i] $\leq n - 1$

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.