Island Shape Perimeter - Amazon Top Interview Questions
Problem Statement :
Given a two-dimensional integer matrix of 1s and 0s where 0 represents empty cell and 1 represents a block that forms a shape, return the perimeter of the shape. There is guaranteed to be exactly one shape, and the shape has no holes in it.
Constraints
1 ≤ n, m ≤ 250 where n and m are the number of rows and columns in matrix
Example 1
Input
matrix = [
[0, 1, 1],
[0, 1, 0]
]
Output
8
Solution :
Solution in C++ :
int solve(vector<vector<int>>& matrix) {
int M = matrix.size(), N = matrix[0].size(), blocks = 0, neighbors = 0;
auto valid = [&](int x, int y) {
return !(x < 0 || x >= M || y < 0 || y >= N || !matrix[x][y]);
};
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
if (matrix[i][j]) {
blocks++;
neighbors += valid(i - 1, j) ? 1 : 0;
neighbors += valid(i + 1, j) ? 1 : 0;
neighbors += valid(i, j - 1) ? 1 : 0;
neighbors += valid(i, j + 1) ? 1 : 0;
}
}
}
return blocks * 4 - neighbors;
}
Solution in Java :
import java.util.*;
class Solution {
public int solve(int[][] matrix) {
int per = 0;
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix[i].length; j++) {
if (matrix[i][j] == 1) {
if (i > 0 && matrix[i - 1][j] == 0) {
per++;
} else if (i == 0) {
per++;
}
// System.out.println(per);
if (i < matrix.length - 1 && matrix[i + 1][j] == 0) {
per++;
} else if (i == matrix.length - 1) {
per++;
}
// System.out.println(per);
if (j > 0 && matrix[i][j - 1] == 0) {
per++;
} else if (j == 0) {
per++;
}
// System.out.println(per);
if (j < matrix[i].length - 1 && matrix[i][j + 1] == 0) {
per++;
} else if (j == matrix[i].length - 1) {
per++;
}
// System.out.println(per);
}
}
}
return per;
}
}
Solution in Python :
class Solution:
def solve(self, matrix):
lt = 0
perimeter = 0
height = len(matrix)
length = len(matrix[0])
for line in matrix:
vt = 0
for val in line:
if val == 1:
surround = 4
if vt != length - 1:
if matrix[lt][vt + 1] == 1:
surround -= 1
if vt != 0:
if matrix[lt][vt - 1] == 1:
surround -= 1
if lt != height - 1:
if matrix[lt + 1][vt] == 1:
surround -= 1
if lt != 0:
if matrix[lt - 1][vt] == 1:
surround -= 1
perimeter += surround
vt += 1
lt += 1
return perimeter
View More Similar Problems
Array-DS
An array is a type of data structure that stores elements of the same type in a contiguous block of memory. In an array, A, of size N, each memory location has some unique index, i (where 0<=i<N), that can be referenced as A[i] or Ai. Reverse an array of integers. Note: If you've already solved our C++ domain's Arrays Introduction challenge, you may want to skip this. Example: A=[1,2,3
View Solution →2D Array-DS
Given a 6*6 2D Array, arr: 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 An hourglass in A is a subset of values with indices falling in this pattern in arr's graphical representation: a b c d e f g There are 16 hourglasses in arr. An hourglass sum is the sum of an hourglass' values. Calculate the hourglass sum for every hourglass in arr, then print t
View Solution →Dynamic Array
Create a list, seqList, of n empty sequences, where each sequence is indexed from 0 to n-1. The elements within each of the n sequences also use 0-indexing. Create an integer, lastAnswer, and initialize it to 0. There are 2 types of queries that can be performed on the list of sequences: 1. Query: 1 x y a. Find the sequence, seq, at index ((x xor lastAnswer)%n) in seqList.
View Solution →Left Rotation
A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d
View Solution →Sparse Arrays
There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun
View Solution →Array Manipulation
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu
View Solution →