hard_problem.py

# given an NxN array of colors (rgb) randomly distributed
# write an function that returns the largest area of the same color
# areas are defined as having a common side (no diagonals)
from random import choice
from typing import Tuple

colors = ("r", "g", "b")


def generate_array(size):
    ret = []
    for _ in range(size):
        row = []
        for _ in range(size):
            row.append(choice(colors))
        ret.append(row)
    return ret


data = [
    ["r", "r", "b"],
    ["r", "r", "b"],
    ["r", "g", "r"],
]


expected_output = [
    (0, 0),
    (0, 1),
    (0, 2),
    (1, 1),
    (1, 0),
]