##
Easy way to remember Strassen’s Matrix Equation
March 3, 2017

Strassen’s matrix is a Divide and Conquer method that helps us to multiply two matrices(of size n X n). You can refer to the link,… Read More »

March 3, 2017

Strassen’s matrix is a Divide and Conquer method that helps us to multiply two matrices(of size n X n). You can refer to the link,… Read More »

Given a square matrix of order N*N having distinct elements, the task is to sort given matrix in such a way that its rows, columns… Read More »

March 2, 2017

Given a binary matrix of N rows and M columns. The operation allowed on the matrix is to choose any index (x, y) and toggle… Read More »

Given a N x N matrix, determine the maximum K such that K x K is a submatrix with all equal elements i.e., all the… Read More »

February 28, 2017

Given a 2N x 2N matrix of integers. You are allowed to reverse any row or column any number of times and in any order.… Read More »

February 26, 2017

Given a 2D array, the task is to print the 2D in alternate manner (First row from left to right, then from right to left,… Read More »

February 25, 2017

Given a N X N matrix Mat[N][N] of positive integers. There are only three possible moves from a cell (i, j) (i+1, j) (i+1, j-1)… Read More »

February 24, 2017

Given N X N matrix filled with 1 , 0 , 2 , 3 . Find whether there is a path possible from source to… Read More »

February 22, 2017

Given a binary matrix of N x M, containing at least a value 1. The task is to find the distance of nearest 1 in… Read More »

February 20, 2017

Consider a N X N matrix where each element is row number divide by column number (integer division), i.e. mat[i][j] = floor((i+1)/(j+1)) where 0 4… Read More »

Prerequisite : Sparse Matrix and its representations Set 1 (Using Arrays and Linked Lists) In this post other two methods of sparse matrix representation are… Read More »

February 15, 2017

Given two matrices A and B of order n*m. The task is to find the required number of transformation steps so that both matrices became… Read More »

February 14, 2017

Given a positive integer n that represents dimensions of a 4n x 4n matrix with values from 1 to n filled from left to right… Read More »

February 12, 2017

Prerequisite : Dynamic Programming | Set 8 (Matrix Chain Multiplication) Given a sequence of matrices, find the most efficient way to multiply these matrices together.… Read More »

February 9, 2017

Given a 2-D matrix A[N][M] where A[i][j] denotes the points available on this cell. Two persons, P1 and P2, start from two corners of this… Read More »