Trail to Minimize Effort - Google Top Interview Questions
Problem Statement :
You are given a two-dimensional list of integers matrix where element represents the height of a hill.
You are currently on the top left cell and want to go to the bottom right cell.
In each move, you can go up, down, left, or right.
A path's cost is defined to the largest absolute difference of heights between any two consecutive cells in the path.
Return the minimum cost of any path.
Constraints
1 ≤ n, m ≤ 250 where n and m are the number of rows and columns in matrix
Example 1
\
Input
matrix = [
[1, 5, 3],
[2, 4, 3],
[3, 5, 3]
]
Output
2
Explanation
We can take the following path [1, 2, 4, 5, 3]. The largest absolute difference of heights between any
two consecutive cells is between 2 and 4.
Solution :
Solution in C++ :
int solve(vector<vector<int>>& matrix) {
int n = matrix.size(), m = matrix[0].size();
vector<int> dir{0, -1, 0, 1, 0};
vector<vector<int>> dist(n, vector<int>(m, INT_MAX));
set<pair<int, pair<int, int>>> s;
// setting the base case
dist[0][0] = 0;
s.insert({0, {0, 0}});
while (!s.empty()) {
auto [distance, cord] = *s.begin();
auto [xcord, ycord] = cord;
s.erase(s.begin());
for (int k = 0; k < 4; k++) {
int x = xcord + dir[k];
int y = ycord + dir[k + 1];
if (x >= 0 and x < n and y >= 0 and y < m) {
int maxd = max(distance, abs(matrix[x][y] - matrix[xcord][ycord]));
if (dist[x][y] > maxd) {
if (s.find({dist[x][y], {x, y}}) != s.end()) {
s.erase(s.find({dist[x][y], {x, y}}));
}
dist[x][y] = maxd;
s.insert({dist[x][y], {x, y}});
}
}
}
}
return dist[n - 1][m - 1];
}
Solution in Java :
import java.util.*;
class Solution {
static int M;
public int solve(int[][] matrix) {
int N = matrix.length;
M = matrix[0].length;
DisjointSetUnion dsu = new DisjointSetUnion(N * M);
ArrayList<Edge> edges = new ArrayList<Edge>();
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
if (i < N - 1)
edges.add(new Edge(i, j, 'D', Math.abs(matrix[i][j] - matrix[i + 1][j])));
if (j < M - 1)
edges.add(new Edge(i, j, 'R', Math.abs(matrix[i][j] - matrix[i][j + 1])));
}
}
Collections.sort(edges);
for (Edge e : edges) {
dsu.connect(e.a, e.b);
if (dsu.connected(0, N * M - 1))
return e.w;
}
return 0;
}
static class Edge implements Comparable<Edge> {
int a;
int b;
int w;
public Edge(int i, int j, char d, int w) {
a = i * M + j;
if (d == 'D')
b = (i + 1) * M + j;
else
b = i * M + (j + 1);
this.w = w;
}
public int compareTo(Edge e) {
return w - e.w;
}
}
static class DisjointSetUnion {
public int[] parent;
public int[] weight;
public int count;
public DisjointSetUnion(int N) {
count = N;
parent = new int[N];
for (int i = 0; i < N; i++) parent[i] = i;
weight = new int[N];
Arrays.fill(weight, 1);
}
//"find"
public int root(int p) {
if (p == parent[p])
return p;
return parent[p] = root(parent[p]);
}
//"union"
public void connect(int p, int q) {
p = root(p);
q = root(q);
if (p == q)
return;
if (weight[p] < weight[q]) {
parent[p] = q;
weight[q] += weight[p];
} else {
parent[q] = p;
weight[p] += weight[q];
}
count--;
}
public boolean connected(int p, int q) {
return root(p) == root(q);
}
}
}
Solution in Python :
class Solution:
def solve(self, A):
R, C = len(A), len(A[0])
DIRS = [[1, 0], [0, 1], [-1, 0], [0, -1]]
def bfs(cost):
q = [[0, 0]]
seen = set(tuple([0, 0]))
while q:
i, j = q.pop()
if i == R - 1 and j == C - 1:
return True
for di, dj in DIRS:
ni, nj = di + i, dj + j
if (
0 <= ni < R
and 0 <= nj < C
and abs(A[ni][nj] - A[i][j]) <= cost
and tuple([ni, nj]) not in seen
):
seen.add(tuple([ni, nj]))
q.append([ni, nj])
return False
l = 0
r = max([max(x) for x in A])
while l < r:
m = l + r >> 1
if bfs(m):
r = m
else:
l = m + 1
return l
View More Similar Problems
Jim and the Skyscrapers
Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space
View Solution →Palindromic Subsets
Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t
View Solution →Counting On a Tree
Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n
View Solution →Polynomial Division
Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie
View Solution →Costly Intervals
Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the
View Solution →The Strange Function
One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting
View Solution →