## Check if a number from every row can be selected such that xor of the numbers is greater than zero

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 »

- Minimum steps to reach any of the boundary edges of a matrix | Set 1
- Minimum steps to reach any of the boundary edges of a matrix | Set-2
- Print matrix in snake pattern from the last column
- Find number of Positional Elements
- Find number of cavities in a matrix
- Minimum distance to the end of a grid from source
- Find alphabet in a Matrix which has maximum number of stars around it
- Program to print Spiral Pattern
- Minimum steps required to convert X to Y where a binary matrix represents the possible conversions
- Interchange elements of first and last columns in matrix
- Sum of all Submatrices of a Given Matrix
- Print numbers in matrix diagonal pattern
- A variation of Rat in a Maze : multiple steps or jumps allowed
- Print the matrix diagonally downwards
- Print all paths from top left to bottom right in a matrix with four moves allowed
- Search element in a Spirally sorted Matrix
- Unique paths covering every non-obstacle block exactly once in a grid
- Find maximum path length in a binary matrix
- Program to find the Sum of each Row and each Column of a Matrix
- Find sub-matrix with the given sum
- Minimum distance to the corner of a grid from source
- Minimum sum falling path in a NxN grid
- Print matrix in zig-zag fashion from the last column
- Sum of bitwise AND of all submatrices
- XOR of XORs of all sub-matrices
- Magical Pattern
- Search in a sorted 2D matrix (Stored in row major order)
- Sum of Bitwise-OR of all Submatrices
- Count the total number of squares that can be visited by Bishop in one move
- Find the sum of the diagonal elements of the given N X N spiral matrix

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 »

Given task is to read a matrix from the user. The size and number of elements of matrices are to be read from the keyboard.… Read More »

The problem is to count all the possible paths from top left to bottom right of an m*n matrix with the constraints that from each… Read More »

Given a binary grid of order r * c and an initial position. The task is to find the minimum distance from the source to… Read More »

Given a 2-D matrix mat[][] the task is count the number of connected components in the matrix. A connected component is formed by all equal… Read More »