BitmapHoles / 2D Matrix

SearchingChallenge.ts

function searchChallenge(strArr: string[]): number {
  let contiguousRegions = 0;
  const matrix: number[][] = strArr.map((x: string): number[] => x.split('')
    .map((y: string): number => +y));
  
  const search = (row: number, col: number) => {
    if (row >= 0 && row < matrix.length && col >= 0 && col < matrix[row].length && matrix[row][col] === 0) {
      matrix[row][col] = 2;
      
      // up
      search(row - 1, col); 
      
      // down
      search(row + 1, col); 
      
      // left
      search(row, col - 1); 
      
       // right
      search(row, col + 1);
    }
  }
  
  matrix.forEach((row: number[], rowIndex: number) => {
    row.forEach((value: number, colIndex: number) => {
      if (value !== 0) return;

      contiguousRegions++;
      
      search(rowIndex, colIndex);
    })
  });

  return contiguousRegions;
}

console.log(searchChallenge(["10111", "10101", "11101", "11101"])); // 2
console.log(searchChallenge(["10111", "10101", "11101", "11111"])); // 2