**Enclosed Islands - Google Top Interview Questions**

### Problem Statement :

You are given a two-dimensional integer matrix of 1s and 0s. A 1 represents land and 0 represents water. From any land cell you can move up, down, left or right to another land cell or go off the matrix. Return the number of land cells from which we cannot go off the matrix. Constraints n, m ≤ 250 where n and m are the number of rows and columns in matrix Example 1 Input matrix = [ [0, 0, 0, 1], [0, 1, 1, 0], [0, 1, 1, 0], [0, 0, 0, 0] ] Output 4 Explanation There's 4 land squares in the middle from which we cannot walk off the matrix.

### Solution :

` ````
Solution in C++ :
def find_answer():
for cell in matrix:
if cell is edge_cell:
push cell in queue
while queue is not empty:
current_cell = 0 # marking as visited
for neighbor of current_cell:
if neighbor is land:
push neighbor in queue
return number of lands in matrix
```

` ````
Solution in Java :
import java.util.*;
class Solution {
private int[][] matrix;
public int solve(int[][] matrix) {
this.matrix = matrix;
// sink all islands touching an edge, then count land cells in interior.
/// check for the vertical edges
for (int i = 0; i < matrix.length; i++) {
if (matrix[i][0] == 1) {
floodfill(i, 0);
}
if (matrix[i][matrix[0].length - 1] == 1) {
floodfill(i, matrix[0].length - 1);
}
}
// check for the horizontal edges
for (int j = 0; j < matrix[0].length; j++) {
if (matrix[0][j] == 1) {
floodfill(0, j);
}
if (matrix[matrix.length - 1][j] == 1) {
floodfill(matrix.length - 1, j);
}
}
int ret = 0;
for (int i = 1; i < matrix.length - 1; i++) {
for (int j = 1; j < matrix[0].length - 1; j++) {
ret += matrix[i][j];
}
}
return ret;
}
public void floodfill(int i, int j) {
if (i == -1 || j == -1 || i == matrix.length || j == matrix[0].length
|| matrix[i][j] == 0) {
return;
}
matrix[i][j] = 0;
floodfill(i + 1, j);
floodfill(i - 1, j);
floodfill(i, j + 1);
floodfill(i, j - 1);
}
}
```

` ````
Solution in Python :
class Solution:
def solve(self, matrix):
q = [
(i, j)
for i in range(len(matrix))
for j in range(len(matrix[i]))
if matrix[i][j]
and (i == 0 or i == len(matrix) - 1 or j == 0 or j == len(matrix[i]) - 1)
]
idx = 0
for x, y in q:
matrix[x][y] = 0
while idx < len(q):
x, y = q[idx]
for dx, dy in [(-1, 0), (0, -1), (0, 1), (1, 0)]:
nx, ny = x + dx, y + dy
if 0 <= nx < len(matrix) and 0 <= ny < len(matrix[nx]) and matrix[nx][ny]:
matrix[nx][ny] = 0
q.append((nx, ny))
idx += 1
return sum(sum(row) for row in matrix)
```

## View More Similar Problems

## Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .

View Solution →## Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

View Solution →## Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .

View Solution →## Self Balancing Tree

An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ

View Solution →## Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty

View Solution →## Median Updates

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

View Solution →