## Find minimum steps required to reach the end of a matrix | Set – 1

Given a 2d-matrix consisting of positive integers, the task is to find the minimum number of steps required to reach the end(leftmost-bottom cell) of the… Read More »

- Sum of all Submatrices of a Given Matrix
- A variation of Rat in a Maze : multiple steps or jumps allowed
- Find sub-matrix with the given sum
- Search element in a Spirally sorted Matrix
- Minimum distance to the corner of a grid from source
- Unique paths covering every non-obstacle block exactly once in a grid
- Count number of ways to reach a given score in a Matrix
- Maximum sum path in a matrix from top to bottom and back
- Sum of bitwise AND of all submatrices
- Find the sum of the diagonal elements of the given N X N spiral matrix
- Minimum steps required to reach the end of a matrix | Set 2
- Sum of Bitwise-OR of all Submatrices
- Minimum operations of given type to make all elements of a matrix equal
- XOR of XORs of all sub-matrices
- Find minimum steps required to reach the end of a matrix | Set - 1
- Minimum time required to rot all oranges | Dynamic Programming
- Count the total number of squares that can be visited by Bishop in one move
- How to read a Matrix from user in Java?
- Number of submatrices with OR value 1
- Find minimum steps required to reach the end of a matrix | Set 2
- Rat in a Maze Problem when movement in all possible directions is allowed
- Number of submatrices with all 1s
- Maths behind number of paths in matrix problem
- Check if the robot is within the bounds of the grid after given moves
- Count possible moves in the given direction in a grid
- XOR of a submatrix queries
- Element in a matrix starting from which anti-clockwise traversal ends at the last element
- Find maximum path sum in a 2D matrix when exactly two left moves are allowed
- Find row with maximum and minimum number of zeroes in given Matrix
- Find the original matrix when largest element in a row and a column are given

Given a 2d-matrix consisting of positive integers, the task is to find the minimum number of steps required to reach the end(leftmost-bottom cell) of the… Read More »

Given a matrix of dimension N * M. The task is find the maximum sum of path from arr[0][0] to arr[N – 1][M – 1]… Read More »

Given two n * m matrices A[][] and B[][], the task is to make both the matrices strictly increasing (both rows and columns) only by… Read More »

Given a grid of size N X M and a robot is placed at cell (N – 1, M – 1). Also, given string str… Read More »

Given a 2-D array of order N X M array elements, the task is to check if we can select a number from every row… Read More »

Given two arrays A[] and B[] of N and M integers respectively. Also given is a N X M binary matrix where 1 indicates that… Read More »

Given two binary matrices A[][] and B[][] of N X M. In a single operation, one can choose a sub-matrix (min of 2 rows and… Read More »

Given an integer N. The task is to generate a symmetric matrix of order N*N having the following properties. Main diagonal should contain only 0’s… Read More »

Given a 2D matrix mat[][], the task is to find the maximum sum of a cocktail glass. A Cocktail glass is made of 6 cells… Read More »

Given N which is the size of the N X N spiral matrix of the form: 16 15 14 13 5 4 3 12 6… Read More »

Given a mat[][] of size n X n, the task is to find an element X such that if the anti-clockwise traversal is begun from… Read More »

Given a N x N matrix mat[][] consisting of non-negative integers, the task is to find the number of ways to reach a given score… Read More »

Given an N x N matrix mat[][], the task is to find the maximum trace possible for any sub-matrix of the given matrix. Examples: Input:… Read More »

Given two N X M matrices of integers. In an operation, we can transpose any square sub-matrix in matrix1. The task is to check if… Read More »

Given a NxN matrix. The task is to check if after reversing all of the rows of the given Matrix, the matrix remains same or… Read More »