## Check if a pair with given product exists in a Matrix

Given a NxM matrix and a product K. The task is to check if a pair with the given product exists in the matrix or… 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
- Number of shortest paths to reach every cell from bottom-left cell in the grid
- Count number of ways to reach destination in a Maze using BFS
- Find the number of paths of length K in a directed graph
- Print a given matrix in spiral form using direction tracking method
- Maze With N doors and 1 Key
- Implementation of BFS using adjacency matrix
- Find the position of the given row in a 2-D array
- Check if a cycle of length 3 exists or not in a graph that satisfy a given condition
- 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
- C++ program to Convert a Matrix to Sparse Matrix
- Find the number of cells in the table contains X
- Largest sub-matrix with all equal elements
- Minimum number of steps to convert a given matrix into Diagonally Dominant Matrix
- Print Lower Hessenberg matrix of order N
- Minimum steps required to convert the matrix into lower hessenberg matrix
- Print all the sub diagonal elements of the given square matrix
- Find the sum of elements of the Matrix generated by the given rules
- Find an N x N grid whose xor of every row and column is equal
- Find a Square Matrix such that sum of elements in every row and column is K
- Maximum perimeter of a square in a 2D grid
- Print all the super diagonal elements of the given square matrix
- Check if it is possible to move from (0, 0) to (X, Y) in exactly K steps
- Implementation of DFS using adjacency matrix
- Print Upper Hessenberg matrix of order N
- Minimum number of steps to convert a given matrix into Upper Hessenberg matrix

Given a NxM matrix and a product K. The task is to check if a pair with the given product exists in the matrix or… Read More »

Given a NxM matrix and a sum S. The task is to check if a pair with given Sum exists in the matrix or not.… Read More »

Given a NxM matrix with N rows and M columns of positive integers. The task is to find the pair with the maximum difference in… Read More »

Given a NxM matrix with N rows and M columns of positive integers. The task is to find the sum of pair with maximum sum… Read More »

Given a NxM matrix. The task is to find the maximum element in this matrix. Examples: Input: mat[4][4] = {{1, 2, 3, 4}, {25, 6,… Read More »

Given an NxN matrix. The task is to find the sum of the alternate elements of the given matrix. For example, in a 2 x… Read More »

A square matrix is a matrix in which contains elements in the form of Rows and Columns. Below is an example of a 5×5 matrix.… Read More »

Given a N * M matrix. The task is to traverse the given matrix in L shape as shown in below image. Examples: Input :… Read More »

Given a N*N matrix of positive integers. The task is to find the maximum difference between any pair of elements in any column of the… Read More »

Given a N*N matrix. The task is to find the index of column with maximum sum. That is the column whose sum of elements are… Read More »

Given an N*N matrix. The task is to find the index of a row with the maximum sum. That is the row whose sum of… Read More »

Given a boolean 2D matrix. The task is to find the number of distinct islands where a group of connected 1s (horizontally or vertically) forms… Read More »

Given a m x n matrix of positive integers. The task is to find the number of paths from the top left of the matrix… Read More »

Given a matrix with N rows and M columns. The task is to print the index of columns of the given matrix based on the… Read More »

Given an array of n size contains the cost of sweets in such a way that that sweet[i] is the cost of i sweets. The… Read More »