## Maximize sum by choosing elements from different section of a matrix

Given a matrix of N rows and M columns. It is given that M is a multiple of 3. The columns are divided into 3… 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
- Find the element in the matrix generated by given rules
- 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

Given a matrix of N rows and M columns. It is given that M is a multiple of 3. The columns are divided into 3… Read More »

Given a matrix, the task is to convert the given Matrix into sorted Spiral Matrix. Examples: Input: y[][] = { { 2, 5, 12 },… Read More »

Given an array, the task is to form a spiral matrix Examples: Input: arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9,… Read More »

Given two integers X and Y. The task is to find the number of ways to reach (X, Y) in a matrix starting from the… Read More »

Given n x n points on cartesian plane, the task is to find the weight at (xi, yj) after m operation. xi, yj, w denotes… Read More »

Given an N * M 2D binary matrix, the task is to find the count of columns having odd number of 1s. Examples: Input: mat[][]… Read More »

Given a 2D square matrix, print the Principal and Secondary diagonals. Examples : Input: 4 1 2 3 4 4 3 2 1 7 8… Read More »

Given a square matrix, the task is to find the element of the matrix where the right and the left diagonal of this square matrix… Read More »

Given an M × N matrix. The task is to count the number of adjacent cells and calculate their sum. Two cells are said to… Read More »

Given a point (X, Y) in a 2-D plane and an integer K, the task is to check whether it is possible to move from… Read More »

Given a binary matrix of size N * M, the task is to find the largest area sub-matrix such that all elements in it are… Read More »

Breadth First Search (BFS) has been discussed in this article which uses adjacency list for the graph representation. In this article, adjacency matrix will be… Read More »

Depth First Search (DFS) has been discussed in this article which uses adjacency list for the graph representation. In this article, adjacency matrix will be… Read More »

Given a binary matrix mat[][] of size M * N. The task is to check whether the row of the matrix will be unique after… Read More »

Given a matrix of integers mat[][] of size N * M. The task is to find the maximum perimeter of a square in the matrix.… Read More »