Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.