## Count number of ways to reach destination in a Maze using BFS

Given a maze with obstacles, count number of paths to reach rightmost-bottom most cell from the topmost-leftmost cell. A cell in the given maze has… 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
- Number of shortest paths to reach every cell from bottom-left cell in the grid
- Find the sum of the diagonal elements of the given N X N spiral matrix
- Find minimum steps required to reach the end of a matrix | Set - 1
- 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
- Maths behind number of paths in matrix problem
- Print a given matrix in spiral form using direction tracking method
- Find row with maximum and minimum number of zeroes in given Matrix
- Find maximum path sum in a 2D matrix when exactly two left moves are allowed
- Find the position of the given row in a 2-D array
- Check if matrix can be converted to another matrix by transposing square sub-matrices
- Check if the robot is within the bounds of the grid after given moves
- 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
- Number of ways to reach the end of matrix with non-zero AND value
- Find a sub matrix with maximum XOR
- Find a way to fill matrix with 1's and 0's in blank positions
- Find the original matrix when largest element in a row and a column are given
- Queries to find the last non-repeating character in the sub-string of a given string
- Find the number of cells in the table contains X
- Find if a binary matrix exists with given row and column sums
- Find the number of p-sided squares in a grid with K blacks painted

Given a maze with obstacles, count number of paths to reach rightmost-bottom most cell from the topmost-leftmost cell. A cell in the given maze has… Read More »

Given two number N and M. The task is to find the number of shortest paths to reach the cell(i, j) in the grid of… Read More »

Given a grid of size H*W with all cells initially white. Given N pairs (i, j) in an array, for each pair, paint cell (i,… Read More »

Given two integer N and X. N represents the number of rows and columns of a table. And the element at the ith row and… Read More »

Given three integers A, B and R, the task is to find the sum of all the elements of the matrix generated by the given… Read More »

Given a maze of 0 and -1 cells, the task is to find all the paths from (0, 0) to (n-1, m-1), and every path… Read More »

Given a 2-D matrix mat[][], the task is to print it in the spiral form. Examples: Input: mat[][] = { {1, 2, 3, 4}, {5,… Read More »

Consider a rat placed at (0, 0) in a square matrix m[ ][ ] of order n and has to reach the destination at (n-1,… Read More »

Given a matrix of order NxN, the task is to find the minimum number of steps to convert given matrix into Diagonally Dominant Matrix. In… Read More »

Given a matrix mat[][] of size m * n which is sorted in row-wise fashion and an array row[], the task is to check if… Read More »

Given a directed, unweighted graph with N vertices and an integer K. The task is to find the number of paths of length K for… Read More »

Given a matrix of dimension m * n where each cell in the matrix can have values 0, 1 or 2 which has the following… Read More »

Given an N*N matrix mat[][], the task is to find the sum of Eigen values of the given matrix. Examples: Input: mat[][] = { {2,… Read More »

Given a matrix of order NxN, Find the minimum number of steps to convert given matrix into Lower Hessenberg matrix. In each step, the only… Read More »

Given a matrix of order NxN, Find the minimum number of steps to convert given matrix into Upper Hessenberg matrix. In each step, the only… Read More »