This was a very interesting problem to understand in the first place.
Given a board that is a kingdom. The board is represented as an array of strings. Each string contains a number of tiles separated by a space. Each tile consists of a letter, and there can be 0-9 crowns. Your task is to calculate the total score. The score calculation is done by using the following formula:
number of same tiles in an area * number of crowns in that area.
A board can be of any size no greater than 5x5.
Example:
Input:
["L0 W1 W1 W0 F2",
"W0 W0 T0 T0 T0",
"W0 W1 T0 R2 R1" ,
"L0 K0 L1 L0 L0",
"R0 C2 C0 L1 T0"]
Output: 41
Explanation: The total score of this board is 41.
(1 * 0) + (7 * 3) + (1 * 2) + (4 * 0) + (2 * 3) + (1 * 0) + (4 * 2) + (1 * 0) + (2 * 2) + (1 * 0) = 0 + 21 + 2 + 0 + 6 + 0 + 8 + 0 + 4 + 0 = 41.
Result: Rejection.