Editorial - PICNICBUS

Problem link - Link

Author- Manas Rawat
Tester - Manas Rawat
Editorialist - Rishabh Verma

Difficulty :

You have given N number of student who have M number of friend connection . Each friend group wants to travel in the bus with his friend circle only . Your task is to find minimum numbers of bus required for this .


This question is based on simple and standard application of graph theory in which we have to find number of connection of each student with one another .

MY Solution -Code