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.
Given an unsorted array of integers, check if it contains four elements tuple (Quadruplets) having given sum.
Given an unsorted linked list, write a function which deletes any duplicate nodes from the list by traversing the list only once.
Given an unsorted array of integers, find a triplet with given sum in it.
Given an array of integers, check if array contains a sub-array having 0 sum.
Given an array of integers, find a subarray having given sum in it.
Given an array of integers, find largest sub-array formed by consecutive integers. The sub-array should contain all distinct values.