Leetcode 3656. Determine if a Simple Graph Exists

Given a sequence of nonnegative integers, determine whether there exists a simple undirected graph (no self-loops or multi-edges) whose vertex degrees match the sequence — typically solved by checking necessary constraints (sum even, each degree ≤ n−1) and applying Havel–Hakimi or the Erdős–Gallai criterion.