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

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

## Travelling Salesman Problem using Branch and Bound

Given a set of cities and distance between every pair of cities, the problem is to find the shortest possible route that visits every city exactly once and returns to the starting point.

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

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

## Find first k maximum occurring words in given set of strings

Given a huge set of strings with duplicate strings present, find first k-maximum occurring words in it.

## Find maximum occurring word in given set of strings

Given a huge set of strings with duplicate strings present, find the maximum occurring word in it. If two words have same count, return any one of them.

## Longest Common Prefix in given set of strings (using Trie)

Find Longest Common Prefix (LCP) in given set of strings.

## Memory efficient Trie Implementation in C++ using Map | Insert, Search and Delete

In this post, we will cover memory efficient Trie implementation in C++ using map data structure.

## Trie Implementation in C | Insertion, Searching and Deletion

Implement insert, search and delete operations on Trie Data structure. Assume that input consist of lowercase letters a-z.