Given an array and an integer k, find the count of distinct elements in every sub-array of size k in the array.
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. The use of any other operator is forbidden.
Given an array of integers, find minimum index of a repeating element in linear time and doing just one traversal of the array.
Write an algorithm to generate any one of the given N numbers according to given probabilities.
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.
Given an array of integers, check if an array is formed by consecutive integers.
Given an array of integers where every element appears even number of times except one element which appears odd number of times, find that odd occurring element in O(log(n)) time and constant space.
Given an unsorted array of integers, find two non-overlapping pairs in it having same sum.