LeetCode
Question
·
Jun 2024
Uber OA
1 upvote
714 views
2 replies
Question Details
Given an undirected graph graph that is represented by its adjacency matrix,
return whether or not is it possible to add no more than two edges to this graph in...
Full Details
Given an undirected graph graph that is represented by its adjacency matrix,
return whether or not is it possible to add no more than two edges to this graph in order to make all the degrees of nodes even. Keep in mind that in the resulting graph there should be at most one edge between any pair of nodes.
Free preview. Unlock all Uber questions →
About This Question
This is a reported interview question from a uber interview for a swe role during the oa round reported in 2024.