## Queries for bitwise OR in the given matrix

Given an N * N matrix mat[][] consisting of non-negative integers and some queries consisting of top-left and bottom-right corner of the sub-matrix, the task… Read More »

- Minimum time required to rot all oranges | Dynamic Programming
- Rat in a Maze Problem when movement in all possible directions is allowed
- Count number of ways to reach destination in a maze
- Minimum steps required to reach the end of a matrix | Set 2
- Number of shortest paths to reach every cell from bottom-left cell in the grid
- Find minimum steps required to reach the end of a matrix | Set - 1
- Count number of ways to reach destination in a Maze using BFS
- Find the number of paths of length K in a directed graph
- Find minimum steps required to reach the end of a matrix | Set 2
- Print a given matrix in spiral form using direction tracking method
- Maze With N doors and 1 Key
- 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
- Implementation of BFS using adjacency matrix
- Find the position of the given row in a 2-D array
- Find a sub matrix with maximum XOR
- Check if a cycle of length 3 exists or not in a graph that satisfy a given condition
- Number of ways to reach the end of matrix with non-zero AND value
- Queries to find the last non-repeating character in the sub-string of a given string
- Find a way to fill matrix with 1's and 0's in blank positions
- Find the number of p-sided squares in a grid with K blacks painted
- Check if the rows of a binary matrix can be made unique by removing a single column
- Find if a binary matrix exists with given row and column sums
- Paths from entry to exit in matrix and maximum path sum
- C++ program to Convert a Matrix to Sparse Matrix
- Find the number of cells in the table contains X
- Maximise matrix sum by following the given Path
- Print an N x M matrix such that each row and column has all the vowels in it
- Largest sub-matrix with all equal elements
- Minimum number of steps to convert a given matrix into Diagonally Dominant Matrix

Given an N * N matrix mat[][] consisting of non-negative integers and some queries consisting of top-left and bottom-right corner of the sub-matrix, the task… Read More »

Given a 2d-matrix mat[][] consisting of positive integers, the task is to find the minimum number of steps required to reach the end of the… Read More »

Given a matrix mat[][] of size N * N, the task is to find the sum of GCDs of all the rows of the given… Read More »

Given an N * N matrix arr[][] consisting of non-negative integers, the task is to find the number of ways to reach arr[N – 1][N… Read More »

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

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 »