Sorted Out-Degree Sequence

Problem

Compute the out-degree of every node and return the sequence sorted in descending order.

edges is a list of directed [u, v] pairs and out-degree counts how many edges leave a node. Return a list of n numbers, largest first, so isolated nodes appear as trailing zeros.

Hint

Tally one increment for the source of each directed edge.

Test cases

case 1

in: [3,[[0,1],[1,2],[2,0]]]

expected: [1,1,1]

case 2

in: [4,[[0,1],[0,2],[0,3]]]

expected: [3,0,0,0]

case 3

in: [1,[]]

expected: [0]

case 4

in: [3,[]]

expected: [0,0,0]

Starter codePython

def sorted_out_degrees(n, edges):
    # Your code here
    pass

4 test cases · run your code against them in the editor