Question

Hostels An institution has decided to open H new hostels for their students, labeled 1 to H. Each hostel initially only has the warden. Each day, one student will be moving into one of the new hostels. On receiving a new student, every existing student and the warden greet him. At the end of any day, the hostel management can decide to move all the students in one of the new hostels to the old hostels. They can do so at most k times in total. There are students coming in N consecutive days. On the ith day, the hostel number to which the student will move into is known. This is in the form of an array arr. Task determine the minimum number of greeting possible in Java coding​

Answer 1

Explanation:

the first contains the number of test case, T=1.