## Find two numbers with maximum sum formed by array digits

Given an array of integers between 0 to 9, find two numbers with maximum sum formed by using all digits of the array. The difference in number of digits of the two numbers should be ± 1.

Coding made easy

Given an array of integers between 0 to 9, find two numbers with maximum sum formed by using all digits of the array. The difference in number of digits of the two numbers should be ± 1.

Given an array of integers, print all maximum size sub-arrays having all distinct elements in them.

Given an array of integers, find a triplet having maximum product in the array.

Write a program to count number of ways to calculate a target number from elements of specified array by using only addition and subtraction operator.

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

Given N lists of words, print all combinations of phrases that can be formed by picking one word each from each of the given lists.

Given a linked list, rearrange it by separating odd nodes from even ones. All even nodes should come before all odd nodes in the output list and the relative order of even and odd nodes should be maintained.

Given an integer, reverse its bits using binary operators and lookup table in O(1) time.

Write an algorithm to generate any one of the given N numbers according to given probabilities.

Given a binary tree, find maximum difference between a node and its descendants in it.

Given an sorted array of integers, find a pair in it having minimum absolute sum.

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