Solving Rabbits in Forest in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Return the minimum number of rabbits that could be in the forest.

Input: answers = [1, 1, 2]
Output: 5
The two rabbits that answered "1" could both be the same color, say red.
The rabbit than 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

Input: answers = []
Output: 0


See the full details of the problem Rabbits in Forest at LeetCode

Originally posted at: