Solution: Rabbits in Forest

Statement

You are given an integer array answers where each element represents a rabbit’s response to the question: how many other rabbits in the forest have the same color as you. Specifically, if answers[i] = k, then that rabbit claims there are exactly $k$ other rabbits with its color.

Assuming every rabbit in answers answered truthfully, return the minimum possible total number of rabbits that could be in the forest, including rabbits that did not provide an answer.

Note: Rabbits that share the same color must have answers that are mutually consistent with the size of their color group.

Constraints:

• $1\le$ ...