You are given meeting rooms of size rooms. You need to distribute k people in these rooms such that they have maximum distance between them. Return the maximum distance possible
Input : rooms = [7,8,3] k=7
Output : 2
We can represent the placement as a 1-D array
[1,0,0,1,0,01], [1,0,0,1,0,0,0,1], [1,0,0]
The distance in the last room doesn't matter since there is only 1 person in that room.