## Find all elements in an array that are greater than all elements present to their right

Given an unsorted array of integers, print all elements which are greater than all elements present to its right.

## Construct a binary tree from inorder and postorder traversals

Write an efficient algorithm to construct a binary tree from given inorder and postorder traversals.

## Count the number of strictly increasing sub-arrays in an array

Given an array, count the number of strictly increasing sub-arrays in it.

## Find missing number in an array without using any extra space

Given a limited range array of size n where array contains elements between 1 to n+1 with one element missing, find the missing number without using any extra space.

## Clone a Linked List with Random Pointers

Write an efficient code to clone a linked list with each node containing an additional random pointer. The random pointer can point to any random node of the linked list or null.

## Convert a Binary Search Tree into a Min Heap

Given a binary search tree (BST), efficiently convert it into a min heap. In order words, convert a binary search tree into a complete binary tree where each node has value is greater than the value of its parent.

## Calculate the minimum cost to reach the destination city from the source city

Given a N x N matrix where each cell of the matrix (i, j) indicates the cost of the direct flight from city i to city j. Find the minimum cost to reach the destination city N-1 from the source city 0.

## Convert a binary tree into a doubly linked list in spiral order

Given a binary tree, convert it into a doubly linked list following the spiral order.

## Threaded Binary Tree: Overview and Implementation

In this post, we will explore about threaded binary tree and see how to convert a normal binary tree to threaded binary tree.

## Find minimum passes required to convert all negative values in the matrix

Given a M x N matrix of integers whose each cell can contain a negative, zero or positive value, determine the minimum number of passes required to convert all negative values in the matrix to positive.

## Clone a binary tree with random pointers

Write an efficient code to clone a binary tree with each node containing an additional random pointer. The random pointer can point to any random node of the binary tree or can be null.

## Find all lexicographically previous permutations of a string sorted in descending order

Given a string sorted in descending order, find all lexicographically previous permutations of it.