The application input takes a random array, which contains 0 or 1.
The array represents a table, where 0 means, there's nothing on the table and 1
means a coffee is spilled on the table.
Write an algorithm, which will find the biggest pool on the table and which counts the number of pools on the table. The pool consists from a group of squares with a spilled coffee (1), which have a common edge, or a common apex.
Solution: Github repository