## Find probability of selecting element from kth column after N iterations

Given a matrix M of order N*M where Mij represent the occurrence of j in row i. The task is to find the probability of… 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
- 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
- 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
- Find the sum of Eigen Values of the given N*N matrix
- Sum of the count of number of adjacent squares in an M X N grid

Given a matrix M of order N*M where Mij represent the occurrence of j in row i. The task is to find the probability of… Read More »

Given a binary matrix of size NxN where 1 denotes that the number i can be converted to j, and 0 denotes it cannot be… Read More »

Given two matrices A and B of order p x q (or q X p) and r x s ( or s X r). The… Read More »

Given a number N denotes the total number of elements in a matrix, the task is to print all possible order of matrix. An order… Read More »

Given a matrix mat[][], the task is to count the number of rows in the matrix that consists of the same elements. Examples: Input: mat[][]… Read More »

Given a 2-D matrix mat[][] of size N * N, initially all the elements of the matrix are 0. A number of queries(M ranges) need… Read More »

Given a binary grid of order r * c and an initial position. The task is to find the minimum distance from the source to… Read More »

Given coordinates of 3 cells (X1, Y1), (X2, Y2) and (X3, Y3) of a matrix. The task is to find the minimum path which connects… Read More »

Given a string of length L. The task is to convert the string into a grid. No. of rows >= floor(√L) No. of columns <=… Read More »

Given an integer N, the task is to print the given pattern. Examples: Input: 3 Output: 1 2 4 3 5 7 6 8 9… Read More »

Given two matrices, the task is to multiply them. The size and number of elements of matrices are to be read from the keyboard. Examples:… Read More »

The problem is to print all the possible paths from top left to bottom right of an mXn matrix with the constraints that from each… Read More »

Given an N X M matrix, where ai, j = 1 denotes the cell is not empty, ai, j = 0 denotes the cell is… Read More »

Given an array arr[] of strings of same length, the task is to count the number of columns to be deleted so that all the… Read More »