Maximize Rook Square Values - Google Top Interview Questions
Problem Statement :
You are given a two-dimensional list of integers board representing a chess board.
Return the maximum sum you can attain by placing two rooks in the board such that they can't attack each other.
The sum is made by adding the two numbers where the rooks are placed.
Constraints
2 ≤ n * m ≤ 200,000 where n and m are the number of rows and columns in board
Example 1
Input
board = [
[1, 9, 3, 1, 9],
[1, 1, 1, 1, 1],
[8, 1, 1, 1, 1]
]
Output
17
Explanation
We can take the 8 square and one of the 9 squares.
Solution :
Solution in C++ :
int solve(vector<vector<int>>& board) {
int n = board.size(), m = board[0].size();
auto go = [&]() {
int t = 0;
vector<int> a(m);
for (int i = 0; i < n; ++i) {
if (i > 0) {
int x = 0;
for (int j = 1; j < m; ++j) {
x = max(x, a[j - 1]);
t = max(t, x + board[i][j]);
}
}
for (int j = 0; j < m; ++j) a[j] = max(a[j], board[i][j]);
}
return t;
};
int ret = 0;
for (int i = 0; i < 2; ++i) {
ret = max(ret, go());
reverse(board.begin(), board.end());
}
return ret;
}
Solution in Java :
import java.util.*;
class Solution {
public int solve(int[][] grid) {
final int R = grid.length, C = grid[0].length;
int[][] topleft = A(grid, R, C);
int[][] topright = B(grid, R, C);
int[][] bottomleft = C(grid, R, C);
int[][] bottomright = D(grid, R, C);
int res = Integer.MIN_VALUE;
for (int r = 0; r != R; r++) {
for (int c = 0; c != C; c++) {
int tmp = Integer.MIN_VALUE;
if (r != 0 && c != 0)
tmp = Math.max(tmp, topleft[r - 1][c - 1]);
if (r != 0 && c != C - 1)
tmp = Math.max(tmp, topright[r - 1][c + 1]);
if (r != R - 1 && c != 0)
tmp = Math.max(tmp, bottomleft[r + 1][c - 1]);
if (r != R - 1 && c != C - 1)
tmp = Math.max(tmp, bottomright[r + 1][c + 1]);
res = Math.max(res, tmp + grid[r][c]);
}
}
return res;
}
private int[][] A(int[][] grid, final int R, final int C) { // top left
int[][] res = new int[R][C];
res[0][0] = grid[0][0];
for (int r = 0; r != R; r++) {
if (r != 0)
res[r][0] = Math.max(res[r - 1][0], grid[r][0]);
for (int c = 1; c != C; c++) {
int tmp = grid[r][c];
if (r != 0)
tmp = Math.max(tmp, res[r - 1][c]);
if (c != 0)
tmp = Math.max(tmp, res[r][c - 1]);
res[r][c] = tmp;
}
}
return res;
}
private int[][] B(int[][] grid, final int R, final int C) { // top right
int[][] res = new int[R][C];
res[0][C - 1] = grid[0][C - 1];
for (int r = 0; r != R; r++) {
if (r != 0)
res[r][C - 1] = Math.max(res[r - 1][C - 1], grid[r][C - 1]);
for (int c = C - 2; c != -1; c--) {
int tmp = grid[r][c];
if (r != 0)
tmp = Math.max(tmp, res[r - 1][c]);
if (c != C - 1)
tmp = Math.max(tmp, res[r][c + 1]);
res[r][c] = tmp;
}
}
return res;
}
private int[][] C(int[][] grid, final int R, final int C) { // bottom left
int[][] res = new int[R][C];
res[R - 1][0] = grid[R - 1][0];
for (int r = R - 1; r != -1; r--) {
if (r != R - 1)
res[r][0] = Math.max(res[r + 1][0], grid[r][0]);
for (int c = 1; c != C; c++) {
int tmp = grid[r][c];
if (r != R - 1)
tmp = Math.max(tmp, res[r + 1][c]);
if (c != 0)
tmp = Math.max(tmp, res[r][c - 1]);
res[r][c] = tmp;
}
}
return res;
}
private int[][] D(int[][] grid, final int R, final int C) { // bottom right
int[][] res = new int[R][C];
res[R - 1][C - 1] = grid[R - 1][C - 1];
for (int r = R - 1; r != -1; r--) {
if (r != R - 1)
res[r][C - 1] = Math.max(res[r + 1][C - 1], grid[r][C - 1]);
for (int c = C - 2; c != -1; c--) {
int tmp = grid[r][c];
if (r != R - 1)
tmp = Math.max(tmp, res[r + 1][c]);
if (c != C - 1)
tmp = Math.max(tmp, res[r][c + 1]);
res[r][c] = tmp;
}
}
return res;
}
}
Solution in Python :
def solve(self, board):
board_vals = [(val, (r, c)) for r, row in enumerate(board) for c, val in enumerate(row)]
mx = max(board_vals)
mx2 = max(v for v in board_vals if v != mx)
mxs = [mx, mx2]
result = 0
for v, (r, c) in mxs:
for nv, (nr, nc) in board_vals:
if nr != r and c != nc:
result = max(result, v + nv)
return result
View More Similar Problems
Kindergarten Adventures
Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti
View Solution →Mr. X and His Shots
A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M
View Solution →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 →