Given a M x N matrix where each cell can have value of 1, 0 or -1, where -1 denotes a unsafe cell, collect maximum number of ones starting from first cell and by visiting only safe cells (i.e. 0 or 1). We are allowed to go only left or down if the row is …
Given a M x N matrix where each cell have non-negative cost associated with it, count number of paths to reach last cell (M-1, N-1) of the matrix from its first cell (0, 0) such that path has given cost. We can only move one unit right or one unit down from any cell. i.e. …
Given a N x N matrix where each cell has distinct value in the 1 to N * N. Find the longest sequence formed by adjacent numbers in the matrix such that for each number, the number on the adjacent neighbor is +1 its value.
Given a M x N matrix where each cell has a cost associated with it, find the minimum cost to reach last cell (M-1, N-1) of the matrix from its first cell (0, 0). We can only move one unit right or one unit down from any cell. i.e. from cell (i, j), we can …
Determine optimal parenthesization of a product of n matrices.
Given a M x N binary matrix, find the size of largest square sub-matrix of 1’s present in it.
Given an M x M matrix, find maximum sum sub-matrix present in it.
Given a M x N matrix, calculate maximum sum k x k sub-matrix in a given M x N matrix in O(M*N) time. Here, 0 < k < M, N.
Given a M x N matrix and two coordinates (p, q) and (r, s) which represents top-left and bottom-right coordinates of a sub-matrix of the given matrix, calculate the sum of all elements present in the sub-matrix in O(1) time. Here, 0 < = p < r < M and 0
Given a M x N matrix which is row wise and column wise sorted (with all strictly increasing elements in any row or column), report all occurrences of a given element in it in linear time.
Given a M x N matrix which is row wise and column wise sorted, count number of negative elements present in it in linear time.
Given an island in the form of square matrix and a point inside the matrix where a person is standing. The person is allowed to move one step in any direction (right, left, top, down) on the matrix. If he steps outside the matrix, he dies. Calculate the probability that he is alive after he …
Given a square matrix, rotate it by 90 degrees in clock-wise direction. The transformation should be done in-place and in quadratic time.
Give a M x N binary matrix, replace all occurrences of 0 by 1 which are not completely surrounded by 1.