0
$\begingroup$

if you are given list of n integers that represents the degree of a graph. How to detect if there self loop in the graph using greedy algorithm.

$\endgroup$
  • 1
    $\begingroup$ What did you try? Where did you get stuck? Have you tried working through a bunch of small examples to see if you can spot any patterns or form any hypotheses? We're happy to help you understand the concepts but just solving exercise-style problems for you is unlikely to achieve that. You might find this page helpful in improving your question. Can you credit the original source where you encountered this task? $\endgroup$ – D.W. Jan 18 at 3:24

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.