## Find total number of unique paths in a maze from source to destination

Find the total number of unique paths which the robot can take in a given maze to reach the destination from given source.

## Find path from source to destination in a matrix that satisfies given constraints

Given a N x N matrix of positive integers, find a path from the first cell of the matrix to its last cell.

## Find Longest Possible Route in a Matrix

Given a rectangular path in the form of binary matrix, find the length of longest possible route from source to destination position of the matrix by moving to only non-zero adjacent positions i.e. route can be formed from positions having their value as 1. Note there should not be any cycles in the output path.

## Find Shortest Path in Maze

Given a maze in the form of the binary rectangular matrix, find length of the shortest path in maze from given source to given destination. The path can only be constructed out of cells having value 1 and at any given moment, we can only move one step in one of the four directions.

## Print all possible solutions to N Queens problem

The N queens puzzle is the problem of placing N chess queens on an N × N chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal.

## Find common elements present in all rows of a matrix

In this post, we will see how to find common elements present in all rows of a given MxN matrix. The solution should traversal the matrix once and print all commons elements in O(M*N) time.

## Calculate size of the largest plus of 1’s in binary matrix

Given a square matrix of 0’s and 1’s, calculate the size of the largest plus formed by 1’s.

## Initialize a matrix in C++

In this post, we will discuss how to initialize a matrix in C++ programming language.

## Find Duplicate Rows in a Binary Matrix

Find duplicate rows present in a given binary matrix by traversing the matrix only once.

## Chess Knight Problem | Find Shortest path from source to destination

Given a chess board, find the shortest distance (minimum number of steps) taken by a Knight to reach given destination from given source.