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

## Total number of paths in given digraph from given source to destination having exactly m edges

Given a digraph (Directed Graph), find the total number of routes to reach the destination from given source that have exactly m edges.

## Check if an undirected graph contains cycle or not

Given an connected undirected graph, find if it contains any cycle or not.

## Minimum number of throws required to win Snake and Ladder game

Find minimum number of throws required to win given Snake and Ladder game.

## Bipartite Graph

Given a graph, check if given graph is bipartite graph or not. A bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint sets U and V such that every edge connects a vertex in U to one in V.

## Breadth First Search (BFS) | Iterative & Recursive Implementation

Breadth first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a ‘search key’) and explores the neighbor nodes first, before moving to the next level neighbors.