Labyrinthian Possibilities - Amazon Top Interview Questions
Problem Statement :
You are given an N by M matrix of 0s and 1s. Starting from the top left corner, how many ways are there to reach the bottom right corner? Mod the result by 10 ** 9 + 7.
You can only move right and down. 0 represents an empty space while 1 represents a wall you cannot walk through. The top left corner and bottom right corner will always be 0.
Constraints
1 ≤ n, m ≤ 250 where n and m are the number of rows and columns in matrix.
Example 1
Input
matrix = [
[0, 0, 1],
[0, 0, 1],
[1, 0, 0]
]
Output
2
Explanation
There are two ways to get to the bottom right:
Right, down, down, right
Down, right, down, right
Example 2
Input
matrix = [
[0, 0, 0],
[0, 0, 0],
[0, 0, 0]
]
Output
6
Explanation
There are 6 ways here:
Right, right, down, down
Down, down, right, right
Right, down, right, down
Down, right, down, right
Right, down, down, right
Down, right, right, down
Example 3
Input
matrix = [
[0, 0, 0],
[1, 1, 1],
[0, 0, 0]
]
Output
0
Explanation
There is a wall in the middle preventing us from getting to the bottom right.
Example 4
Input
matrix = [
[0, 0, 0, 0],
[1, 1, 1, 0],
[0, 0, 0, 0]
]
Output
1
Example 5
Input
matrix = [
[0, 0, 0, 0, 0],
[1, 1, 1, 0, 0],
[0, 0, 0, 0, 0]
]
Output
3
Solution :
Solution in C++ :
int dp[252][252];
int findsum(vector<vector<int>>& matrix, int i, int j) {
if (i == matrix.size() - 1 && j == matrix[i].size() - 1 && matrix[i][j] == 0) {
return dp[i][j] = 1;
}
if (dp[i][j] != -1) return dp[i][j];
while (i < matrix.size() && j < matrix[i].size() && matrix[i][j] == 0) {
return dp[i][j] = (findsum(matrix, i + 1, j) + findsum(matrix, i, j + 1)) % 1000000007;
}
return 0;
}
int solve(vector<vector<int>>& matrix) {
memset(dp, -1, sizeof(dp));
return findsum(matrix, 0, 0);
}
Solution in Java :
import java.util.*;
class Solution {
public int solve(int[][] matrix) {
int MOD = ((int) (Math.pow(10, 9)) + 7);
int m = matrix.length;
int n = matrix[0].length;
int[][] dp = new int[m][n];
dp[0][0] = matrix[0][0] == 1 ? 0 : 1;
if (dp[0][0] == 0)
return 0;
for (int i = 1; i < m; i++) {
if (matrix[i][0] != 1) {
dp[i][0] = dp[i - 1][0];
} else {
dp[i][0] = 0;
}
}
for (int i = 1; i < n; i++) {
if (matrix[0][i] != 1) {
dp[0][i] = dp[0][i - 1];
} else {
dp[0][i] = 0;
}
}
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
if (matrix[i][j] != 1) {
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % MOD;
} else {
dp[i][j] = 0;
}
}
}
return dp[m - 1][n - 1];
}
}
Solution in Python :
class Solution:
def solve(self, matrix):
if len(matrix) == 0:
return 0
matrix[0][0] = -1
for i in range(len(matrix)):
for j in range(len(matrix[0])):
if matrix[i][j] == 1:
continue
if i > 0 and matrix[i - 1][j] != 1:
matrix[i][j] += matrix[i - 1][j]
if j > 0 and matrix[i][j - 1] != 1:
matrix[i][j] += matrix[i][j - 1]
return (-1 * matrix[-1][-1]) % 1000000007
View More Similar Problems
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 →Maximum Element
You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each
View Solution →Balanced Brackets
A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra
View Solution →Equal Stacks
ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of
View Solution →