Longest Matrix Path Length - Google Top Interview Questions
Problem Statement :
You are given a two dimensional integer matrix where 0 is an empty cell and 1 is a wall.
You can start at any empty cell on row 0 and want to end up on any empty cell on row n - 1.
Given that you can move left, right, or down, return the longest such path where you visit each cell at most once. If there is no viable path, return 0.
Constraints
1 ≤ n * m ≤ 200,000 where n and m are the number of rows and columns in matrix.
Example 1
Input
matrix = [
[0, 0, 0, 0],
[1, 0, 0, 0],
[0, 0, 0, 0]
]
Output
10
Explanation
We can move (0, 0), (0, 1), (0, 2), (0, 3), (1, 3), (1, 2), (1, 1), (2, 1), (2, 2), (2, 3).
Solution :
Solution in C++ :
bool isValid(int i, int j, int n, int m) {
if (i >= 0 && i < n && j >= 0 && j < m) return true;
return false;
}
// 0->left,1->right,2->down
// left = i,j-1
// down = i+1,j
// right = i,j+1
int rec(int f, int i, int j, vector<vector<int>>& mat, vector<vector<vector<int>>>& dp, int n,
int m) {
if (i == n - 1) {
if (f == 0 && j == 0) return 0;
if (f == 1 && j == m - 1) return 0;
}
int& ans = dp[f][i][j];
if (ans != -2) return ans;
ans = 0;
if (f == 0) {
// I am in left direction ,hence I can only go left and down
if (isValid(i, j - 1, n, m) && mat[i][j - 1] == 0)
ans = 1 + rec(0, i, j - 1, mat, dp, n, m);
if (isValid(i + 1, j, n, m) && mat[i + 1][j] == 0)
ans = max(ans, 1 + rec(2, i + 1, j, mat, dp, n, m));
} else if (f == 1) {
// I am in right direction , hence I can only go further right and down
if (isValid(i, j + 1, n, m) && mat[i][j + 1] == 0)
ans = 1 + rec(1, i, j + 1, mat, dp, n, m);
if (isValid(i + 1, j, n, m) && mat[i + 1][j] == 0)
ans = max(ans, rec(2, i + 1, j, mat, dp, n, m) + 1);
} else {
// now I am in downward direction hence I can go in all three directions
// cout<<"hel";
if (isValid(i, j + 1, n, m) && mat[i][j + 1] == 0)
ans = 1 + rec(1, i, j + 1, mat, dp, n, m);
if (isValid(i + 1, j, n, m) && mat[i + 1][j] == 0) {
ans = max(ans, 1 + rec(2, i + 1, j, mat, dp, n, m));
// cout<<"hey";
}
if (isValid(i, j - 1, n, m) && mat[i][j - 1] == 0)
ans = max(ans, 1 + rec(0, i, j - 1, mat, dp, n, m));
}
// cout<<ans;
if (ans == 0 && i != n - 1) return ans = -1;
return ans;
}
int solve(vector<vector<int>>& mat) {
int n = mat.size();
if (!n) return 0;
int m = mat[0].size();
// cout<<n<<endl;
vector<vector<vector<int>>> dp(3, vector<vector<int>>(n, vector<int>(m, -2)));
int ans = 0;
for (int j = 0; j < m; j++) {
if (mat[0][j] == 1) continue;
// cout<<"hello
";
// cout<<rec(2,0,j,mat,dp,n,m);
ans = max(ans, 1 + rec(2, 0, j, mat, dp, n, m));
}
return ans;
}
Solution in Java :
import java.util.*;
class Solution {
public int solve(int[][] matrix) {
int N = matrix.length;
int M = matrix[0].length;
int[][] dp = new int[N + 1][M];
for (int i = 0; i < N; i++) Arrays.fill(dp[i], Integer.MIN_VALUE);
for (int i = N - 1; i >= 0; i--) {
for (int j = 0; j < M; j++) {
if (matrix[i][j] == 1)
continue;
for (int k = j; k >= 0; k--) {
if (matrix[i][k] == 1)
break;
int x = 1 + Math.abs(j - k);
dp[i][j] = Math.max(dp[i][j], x + dp[i + 1][k]);
}
for (int k = j; k < M; k++) {
if (matrix[i][k] == 1)
break;
int x = 1 + Math.abs(j - k);
dp[i][j] = Math.max(dp[i][j], x + dp[i + 1][k]);
}
}
}
int ans = 0;
for (int j = 0; j < M; j++) ans = Math.max(ans, dp[0][j]);
return ans;
}
}
Solution in Python :
class Solution:
def solve(self, matrix):
rows = len(matrix)
cols = len(matrix[0])
ninf = -1000000000
@cache
def dfs(x, y, dy):
if x == rows:
return 0
if matrix[x][y] == 1:
return ninf
best = ninf
if dy == 0:
best = max(best, dfs(x, y, 1))
best = max(best, dfs(x, y, -1))
elif 0 <= y + dy < cols:
best = max(best, dfs(x, y + dy, dy) + 1)
best = max(best, dfs(x + 1, y, 0) + 1)
return best
best = 0
for y in range(cols):
best = max(best, dfs(0, y, 0))
return best
View More Similar Problems
Unique Colors
You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti
View Solution →Fibonacci Numbers Tree
Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T
View Solution →Pair Sums
Given an array, we define its value to be the value obtained by following these instructions: Write down all pairs of numbers from this array. Compute the product of each pair. Find the sum of all the products. For example, for a given array, for a given array [7,2 ,-1 ,2 ] Note that ( 7 , 2 ) is listed twice, one for each occurrence of 2. Given an array of integers, find the largest v
View Solution →Lazy White Falcon
White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn't require implementing any fancy techniques? There are 2 types of query operations that can be performed on a tree: 1 u x: Assign x as the value of node u. 2 u v: Print the sum of the node values in the unique path from node u to node v. Given a tree wi
View Solution →Ticket to Ride
Simon received the board game Ticket to Ride as a birthday present. After playing it with his friends, he decides to come up with a strategy for the game. There are n cities on the map and n - 1 road plans. Each road plan consists of the following: Two cities which can be directly connected by a road. The length of the proposed road. The entire road plan is designed in such a way that if o
View Solution →Heavy Light White Falcon
Our lazy white falcon finally decided to learn heavy-light decomposition. Her teacher gave an assignment for her to practice this new technique. Please help her by solving this problem. You are given a tree with N nodes and each node's value is initially 0. The problem asks you to operate the following two types of queries: "1 u x" assign x to the value of the node . "2 u v" print the maxim
View Solution →