This problem is an implementation of the famous flood-fill algorithm. So we're given a matrix, and we need to traverse an element's neighbors, and then repeat. It's always beneficial to think through a smaller input first.

xxxxxxxxxx

const input = [

  [1, 1, 1],

  [1, 1, 1],

  [1, 0, 0]