Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Coding test: Given a simple mockup implement that UI. Some CSS is already provided and an API to fetch the data also exists. The recruiter prep doc talked about structuring the code well, making sure all functions work, write CSS and write tests. There is no way you can do it all in 1 hour, so it's probably best to ask the interviewer what they expect
Coding
- Find if Path Exists in Graph
Coding
- A Graph question, a string question, a couple of array questions.
Coding
- All Ancestors of a Node in a Directed Acyclic Graph
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3656. Determine if a Simple Graph Exists
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source