Can any one point me to a similar LeetCode problem to the following? If not what would be the solution?

Given a 2D array with 0s and 1s. At every step the all 0-cells that are neighbor of a 1-cell, becomes 1. What is the minimum number of steps to make all the cells to 1? If not possible return -1.