## Print all k-colorable configurations of the graph (Vertex coloring of graph)

Given a graph, find if it is k-colorable or not and print all possible configuration of assignment of colors to its vertices.

## Print all Hamiltonian path present in a graph

Given an undirected graph, print all Hamiltonian paths present in it. Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once.

## 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.

## Magnet Puzzle

We are given set of bipolar magnets each domino-shaped. The objective is to place magnets on a M X N board which should meet a set of conditions where both N and M are not odd.

## Print all Possible Knight’s Tours in a chessboard

Given a chess board, print all sequences of moves of a knight on a chessboard such that the knight visits every square only once.

## 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.