## Find Minimum Index of Repeating Element in an Array

Given an array of integers, find minimum index of a repeating element in linear time and doing just one traversal of the array.

## Find Index of Maximum Occurring Element with Equal Probability

Given a collection of integers, develop an algorithm to find the index of maximum occurring element with equal probability.

## Check if an Array is Formed by Consecutive Integers

Given an array of integers, check if an array is formed by consecutive integers.

## Find two non-overlapping pairs having same sum in an array

Given an unsorted array of integers, find two non-overlapping pairs in it having same sum.

## Print Right View of a Binary Tree

Given a binary tree, write an efficient algorithm to print right view of given binary tree.

## Find postorder traversal of a binary tree from its inorder and preorder sequence

Write an efficient algorithm to find postorder traversal of a binary tree from its inorder and preorder sequence.

## Find subarrays with given sum in an array

Given an array of integers, find subarrays with given sum in it.

## Print leaf to root path for every leaf node in a binary tree

Given a binary tree, write an iterative algorithm to print leaf to root path for every leaf node of binary tree. Use of Recursion is prohibited.

## Find a pair with given sum in a BST

Given a binary search tree, find a pair with given sum present in it.

## Find maximum width of given binary tree

Given a binary tree, write an efficient algorithm to compute maximum width of it.

## 3-Partition Problem

3-partition problem: Given a set S of positive integers, determine if it can be partitioned into three disjoint subsets that all have same sum and they cover S.

## Build Binary Tree from given Parent array

Given an array A which represents a binary tree such that the parent-child relationship is defined by (A[i], i) for every index i in the array A, build binary tree out of it. The value of root node will be i if -1 is present at index i in the array. It may be assumed …