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

Read More Flood Fill AlgorithmCoding made easy

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

Read More Flood Fill AlgorithmGiven 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 …

Read More Find shortest safe route in a field with sensors presentGiven 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. 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.

Read More Lee algorithm | Shortest path in a MazeFriends, 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. Remember Learning Today, Building a Solid Foundation for a Brighter Tomorrow. Data Structures and Algorithms by Dr. Naveen Garg Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, …

Read More Best online courses for Data Structures And AlgorithmsGiven a chess board, find the shortest distance (minimum number of steps) taken by a Knight to reach given destination from given source.

Read More Chess Knight Problem | Find Shortest path from source to destinationGiven an connected undirected graph, find if it contains any cycle or not.

Read More Check if an undirected graph contains cycle or notFind minimum number of throws required to win given Snake and Ladder game.

Read More Minimum number of throws required to win Snake and Ladder gameBreadth 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.

Read More Breadth First Search (BFS) | Iterative & Recursive Implementation