Given a collection of integers, develop an algorithm to find the index of maximum occurring element with equal probability.
Given an array of integers, check if an array is formed by consecutive integers.
Given an unsorted array of integers, find two non-overlapping pairs in it having same sum.
Given a binary tree, write an efficient algorithm to print right view of given 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.
Given a binary search tree, find a pair with given sum present in it.
Given a binary tree, write an efficient algorithm to compute maximum width of it.
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.
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.
Given an array of integers, duplicates appear in it even number of times except two elements which appears odd number of times. Find both odd appearing element without using any extra memory.
Given an unsorted array of integers, print all pairs with given difference k in it.
Given an array of integers, duplicates are present in it in such a way that all duplicates appear even number of times except one which appears odd number of times. Find that odd appearing element in linear time and without using any extra memory.