Rabbits in Forest
There is a forest with an unknown count of rabbits. We asked n rabbits "How many other rabbits have the same color as you?" and collected the answers in an integer array answers where answers[i] is the answer of the i th rabbit.
Provided the array answers , produce the minimum count of rabbits that could be in the forest .
Input: answers = [1,1,2]
Output: 5
Explanation: In this case, the two rabbits that answered "1" could both be the same color, say red.
The rabbit that answered "2" can't be red or the answers would be inconsistent.
Say the rabbit that answered "2" was blue.
Then there should be 2 other blue rabbits in the forest that didn't answer into the array.
The smallest possible number of rabbits in the forest is therefore 5: 3 that answered plus 2 that didn't.
Input: answers = [10,10,10]
Output: 11
Constraints
1 <= answers.length <= 10000 <= answers[i] < 1000
Did this problem appear in one of your interviews?
Responses stay private.
