Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2508. Add Edges to Make Degrees of All Nodes Even
Given an undirected simple graph, determine whether you can add at most two edges (no self-loops or duplicates) so every vertex has even degree. The core challenge is a parity check: you must handle cases with 0, 2, or 4 odd-degree nodes and verify whether non-existing edges can pair them up (possibly across components) to fix all parities.
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.