## Check if the given chessboard is valid or not

Given a NXN chessboard. The task is to check if the given chessboard is valid or not. A chess board is considered valid if every… Read More »

- Minimum time required to rot all oranges | Dynamic Programming
- Rat in a Maze Problem when movement in all possible directions is allowed
- Minimum distance to the corner of a grid from source
- Count number of ways to reach a given score in a Matrix
- Maximum sum path in a matrix from top to bottom and back
- Minimum steps required to reach the end of a matrix | Set 2
- Count number of ways to reach destination in a maze
- Find the sum of the diagonal elements of the given N X N spiral matrix
- Sum of Bitwise-OR of all Submatrices
- Find minimum steps required to reach the end of a matrix | Set - 1
- Sum of bitwise AND of all submatrices
- Number of shortest paths to reach every cell from bottom-left cell in the grid
- How to read a Matrix from user in Java?
- 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
- Maths behind number of paths in matrix problem
- Count possible moves in the given direction in a grid
- 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 position of the given row in a 2-D array
- Check if the robot is within the bounds of the grid after given moves
- Check if matrix can be converted to another matrix by transposing square sub-matrices
- Element in a matrix starting from which anti-clockwise traversal ends at the last element
- Number of connected components in a 2-D matrix of strings
- Find the original matrix when largest element in a row and a column are given
- Number of ways to reach the end of matrix with non-zero AND value
- Find a way to fill matrix with 1's and 0's in blank positions
- Queries to find the last non-repeating character in the sub-string of a given string
- Find a sub matrix with maximum XOR

Given a NXN chessboard. The task is to check if the given chessboard is valid or not. A chess board is considered valid if every… Read More »

We are given a recursive function that describes Nth terms in form of other terms. In this article we have taken specific example. Now you… Read More »

Given two integers L and B denoting the length and breadth of a rectangle respectively. The task is to calculate the sum of the area… Read More »

Given the dimension of a chess board (N x M), determine the minimum number of queens required to cover all the squares of the board.… Read More »

Given an array of list of commands U(Up), D(Down), L(Left) and R(Right) and initial cell position (x, y) in a matrix. Find the final cell… Read More »

Given a square matrix, turn it by 90 degrees in anti-clockwise direction without using any extra space. Examples: Input: 1 2 3 4 5 6… Read More »

Given a 2D matrix mat[][] and a value k. Find the largest rectangular sub-matrix whose sum is equal to k. Example: Input : mat =… Read More »

Below are the steps for finding MST using Kruskal’s algorithm 1. Sort all the edges in non-decreasing order of their weight. 2. Pick the smallest… Read More »

We have discussed Prim’s algorithm and its implementation for adjacency matrix representation of graphs. As discussed in the previous post, in Prim’s algorithm, two sets… Read More »

Find an element in a given matrix such that each row and each column is sorted. Examples: Input : arr[] = { { 1, 2,… Read More »

In linear algebra, an n-by-n square matrix A is called Invertible, if there exists an n-by-n square matrix B such that where ‘In‘ denotes the… Read More »

Given a 2-D matrix. The task is to print its corner elements and the sum of the corner elements. Examples: That Input: 2 7 5… Read More »

Given a n*m matrix find the sum of the elements of the matrix without the element specified by its position Examples: Input : mat[] =… Read More »

Given a 3*3 matrix, find the minimum number of changes that need to be made to it in order to turn it into a magic… Read More »

Given a N x N matrix where value at cell (i, j) is the cost of moving from a cell (i, j) to cell (i… Read More »