Given two arrays: array A of length m [A(1..m)], and array B of length n [B(1..n)], find the longest common

# Category: Algorithm

## Shortest Path in a Binary Matrix

In a MxN matrix , a cell can either be 0 or 1. Find the shortest path between a given

## Breadth First Search (BFS) using Adjacency matrix

Graph can be represented using adjacency matrix. Adjacency matrix is a square matrix (m[N][N]) used to represent a graph where

## Breadth First Search (BFS) using Adjacency List

Breadth-first search (BFS) is for traversing/searching tree or graph data structures. It starts at some arbitrary node and explores all

## Stair walking

Stair walking is a mission to reach the highest stair from the bottom. You must obey the following rules to