200. Number of Islands. Leetcode lock in number of islands. A 2D binary grid with ones as land and zeros as water, to return the number of islands. So an island is when water is around land that is vertical or horizontal to each other in the grid. So think about it, I'll show the code. Okay, so we're going to keep track of count with count. And then we're gonna have rows of the grid and columns at the length of the grid at the first position. So now we're going to go through the whole grid. So we'll have two for this. For i in range of row and for j in range of column, we spell it right. For j in range of column. So we're going to make sure if grid at i and j is equal to one. We're gonna increase count by one. And we're gonna also call another function, so this function, it's essentially going to take in all the parameters. So row, column and grid. And whenever you hit an island or land, we're sure that all the land around it turns to zero so we don't double count islands. So that's what this function is going to do. It's gonna turn all the surrounding ones to a one in two zeros. So self, i, j, row, column and grid. And if I is less than zero or I is greater than or equal to row or j is less than zero or j is greater than or equal to column, we just return. So grid at i j is zero, then we could just skip. So if it's a zero, we also return. Now, if it is a one, it should be. We'll just turn it into a zero. So grid at i, j, we turn it into a zero. And then. Now we need to we go to every single position and turn it to a zero. So we'll call the function again on itself, but we'll make sure to use different parameters. So let's just start it with this. And we're gonna do this four times, directions that we could go in. So I'll just paste it in to make it faster. So the first one is row minus one, the second one is row plus one. And then we also want the column plus one and the column minus one. So after that, we just have to return the count here, because we'll have the count after, and we should be done.