Friends (Easy)

Computer Science Level pending

A group of \(N\) people numbered \(1, 2, \ldots, N\) are going to your house for a party. To not let anyone feels left out, you want to befriend the one with the least number of friends. To achieve that, you will ask each of them the question "How many friends do you have?" and note down their response. Before working out the details, you want to make sure that no one give false information. That is, there is at least one possible network of friendships that matches the responses.

Below is a list of responses taken from a group of 10 people. Answer True if it's possible to find a network of friendships that matches, False otherwise.

2 4 3 2 5 3 2 1 1 2


  • Friendship is mutual. If \(A\) is \(B\)'s friend, then \(B\) is \(A\)'s friend as well.

  • You are not counted as their friends at the moment.


Problem Loading...

Note Loading...

Set Loading...