Eight houses, represented as cells, are arranged in a straight line.
Each day every cell competes with its adjacent cells (neighbors).
An integer value `1`

represents an active cell and a value of `0`

represents an inactive cell.
If the neighbors on both the sides of a cell are either `active`

or `inactive`

, the cell becomes `inactive`

on the next day; otherwise the cell becomes `active`

.
The two cells on each end have a single adjacent cell, so assume that the unoccupied space on the opposite side is an `inactive`

cell.
Even after updating the cell state, consider its previous state when updating the state of other cells.
The state information of all cells should be updated simultaneously.

This is a companion discussion topic for the original entry at https://algo.monster/problems/cell_state_after_n_days/