# Category: Queue

## Flood Fill Algorithm

Flood fill (also known asĀ seed fill) is an algorithm that determines the area connected to a given node in a multi-dimensional array.

## Find shortest safe route in a field with sensors present

Given a rectangular field with few sensors present on it, cross it by taking the shortest safe route without activating the sensors.   The rectangular field is given in the form of M x N matrix and we need to find the shortest path from any cell in first column to any cell in the …

## Shortest path in a Maze | Lee algorithm

Given a maze in the form of the binary rectangular matrix, find length of the shortest path in a maze from given source to given destination.

## Best online courses for Data Structures And Algorithms

Friends, this article lists some the of best courses available onlineĀ on Data Structures and Algorithms. We recommend to go through them to have strong basics.   Data Structures and Algorithms by Dr. Naveen Garg Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, Department of Computer Science and Engineering, IIT Delhi. Playlist details …

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

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

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